X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Algorithms - ESA 2003 : 11th annual European symposium, Budapest, Hungary, September 16-19, 2003 ; proceedings (2003)
    Berlin u.a. :Springer,
    Details
    UID:
    almahu_BV017468015
    Format: XIV, 790 S.
    ISBN: 3-540-20064-9
    Series Statement: Lecture notes in computer science 2832
    Note: Includes bibliographical references and index
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Konferenzschrift ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    HU Berlin get availability status
    FU Berlin get availability status
  • 2
    Book
    Book
    Algorithms : 11th annual European symposium ; proceedings (2003)
    Berlin : Springer
    Show associated volumes
    Details
    UID:
    gbv_369167163
    Format: XIV, 790 S. , graph. Darst.
    ISBN: 3540200649
    Series Statement: Lecture notes in computer science 2832
    Additional Edition: Erscheint auch als Online-Ausgabe Di Battista, Giuseppe Algorithms - ESA 2003 Berlin, Heidelberg : Springer Berlin Heidelberg, 2003 ISBN 9783540200642
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Algorithmus ; Algorithmus ; Konferenzschrift
    URL: Cover
    URL: Einführung/Vorwort
    URL: Inhaltsverzeichnis
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
  • 3
    Book
    Book
    Algorithms : 11th annual European symposium ; proceedings (2003)
    Berlin [u.a.] : Springer-Verlag
    Details
    UID:
    kobvindex_ZLB13556873
    Format: XIV, 787 Seiten , graph. Darst. , 24 cm
    Edition: 1. Aufl. 1/2003
    ISBN: 3540200649
    Series Statement: Lecture notes in computer science 2832
    Note: Literaturangaben , Text engl.
    Language: English
    Keywords: Algorithmus ; Kongress ; Budapest 〈2003〉 ; Kongress ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Berlin VÖBB/ZLB get availability status
  • 4
    Online Resource
    Online Resource
    Algorithms - ESA 2003 : 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003. Proceedings (2003)
    Berlin : Springer
    Details
    UID:
    gbv_749174633
    Format: Online-Ressource (XIV, 790 p. Also available online) , digital
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9783540396581 , 3540200649 , 9783540200642
    Series Statement: Lecture Notes in Computer Science 2832
    Content: This book constitutes the refereed proceedings of the 11th Annual European Symposium on Algorithms, ESA 2003, held in Budapest, Hungary, in September 2003. The 66 revised full papers presented were carefully reviewed and selected from 165 submissions. The scope of the papers spans the entire range of algorithmics from design and mathematical analysis issues to real-world applications, engineering, and experimental analysis of algorithms
    Additional Edition: ISBN 9783540200642
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662179284
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540200642
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Konferenzschrift
    DOI: 10.1007/b13632
    URL: lizenzpflichtig
    URL: Volltext  (lizenzpflichtig)
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 5
    Online Resource
    Online Resource
    Algorithms - ESA 2003 : 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003. Proceedings (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920565902882
    Format: XIV, 790 p. , online resource.
    ISBN: 9783540396581
    Series Statement: Lecture Notes in Computer Science, 2832
    Note: Invited Lectures -- Sublinear Computing -- Authenticated Data Structures -- Approximation Algorithms and Network Games -- Contributed Papers: Design and Analysis Track -- I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries -- Line System Design and a Generalized Coloring Problem -- Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties -- Scheduling for Flow-Time with Admission Control -- On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows -- Semi-clairvoyant Scheduling -- Algorithms for Graph Rigidity and Scene Analysis -- Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting -- Multi-player and Multi-round Auctions with Severely Bounded Communication -- Network Lifetime and Power Assignment in ad hoc Wireless Networks -- Disjoint Unit Spheres admit at Most Two Line Transversals -- An Optimal Algorithm for the Maximum-Density Segment Problem -- Estimating Dominance Norms of Multiple Data Streams -- Smoothed Motion Complexity -- Kinetic Dictionaries: How to Shoot a Moving Target -- Deterministic Rendezvous in Graphs -- Fast Integer Programming in Fixed Dimension -- Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs -- Dominating Sets and Local Treewidth -- Approximating Energy Efficient Paths in Wireless Multi-hop Networks -- Bandwidth Maximization in Multicasting -- Optimal Distance Labeling for Interval and Circular-Arc Graphs -- Improved Approximation of the Stable Marriage Problem -- Fast Algorithms for Computing the Smallest k-Enclosing Disc -- The Minimum Generalized Vertex Cover Problem -- An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint -- On-Demand Broadcasting Under Deadline -- Improved Bounds for Finger Search on a RAM -- The Voronoi Diagram of Planar Convex Objects -- Buffer Overflows of Merging Streams -- Improved Competitive Guarantees for QoS Buffering -- On Generalized Gossiping and Broadcasting -- Approximating the Achromatic Number Problem on Bipartite Graphs -- Adversary Immune Leader Election in ad hoc Radio Networks -- Universal Facility Location -- A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm -- I/O-Efficient Undirected Shortest Paths -- On the Complexity of Approximating TSP with Neighborhoods and Related Problems -- A Lower Bound for Cake Cutting -- Ray Shooting and Stone Throwing -- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs -- Binary Space Partition for Orthogonal Fat Rectangles -- Sequencing by Hybridization in Few Rounds -- Efficient Algorithms for the Ring Loading Problem with Demand Splitting -- Seventeen Lines and One-Hundred-and-One Points -- Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves -- Contributed Papers: Engineering and Application Track -- Streaming Geometric Optimization Using Graphics Hardware -- An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals -- Experiments on Graph Clustering Algorithms -- More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling -- The Minimum Shift Design Problem: Theory and Practice -- Loglog Counting of Large Cardinalities -- Packing a Trunk -- Fast Smallest-Enclosing-Ball Computation in High Dimensions -- Automated Generation of Search Tree Algorithms for Graph Modification Problems -- Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation -- Fleet Assignment with Connection Dependent Ground Times -- A Practical Minimum Spanning Tree Algorithm Using the Cycle Property -- The Fractional Prize-Collecting Steiner Tree Problem on Trees -- Algorithms and Experiments for the Webgraph -- Finding Short Integral Cycle Bases for Cyclic Timetabling -- Slack Optimization of Timing-Critical Nets -- Multisampling: A New Approach to Uniform Sampling and Approximate Counting -- Multicommodity Flow Approximation Used for Exact Graph Partitioning -- A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs -- Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540200642
    Language: English
    DOI: 10.1007/b13632
    URL: http://dx.doi.org/10.1007/b13632
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 6
    Online Resource
    Online Resource
    Algorithms - ESA 2003 : 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings (2003)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621257402882
    Format: XIV, 790 p. , online resource.
    Edition: 1st ed. 2003.
    ISBN: 9783540396581
    Series Statement: Lecture Notes in Computer Science, 2832
    Note: Invited Lectures -- Sublinear Computing -- Authenticated Data Structures -- Approximation Algorithms and Network Games -- Contributed Papers: Design and Analysis Track -- I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries -- Line System Design and a Generalized Coloring Problem -- Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties -- Scheduling for Flow-Time with Admission Control -- On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows -- Semi-clairvoyant Scheduling -- Algorithms for Graph Rigidity and Scene Analysis -- Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting -- Multi-player and Multi-round Auctions with Severely Bounded Communication -- Network Lifetime and Power Assignment in ad hoc Wireless Networks -- Disjoint Unit Spheres admit at Most Two Line Transversals -- An Optimal Algorithm for the Maximum-Density Segment Problem -- Estimating Dominance Norms of Multiple Data Streams -- Smoothed Motion Complexity -- Kinetic Dictionaries: How to Shoot a Moving Target -- Deterministic Rendezvous in Graphs -- Fast Integer Programming in Fixed Dimension -- Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs -- Dominating Sets and Local Treewidth -- Approximating Energy Efficient Paths in Wireless Multi-hop Networks -- Bandwidth Maximization in Multicasting -- Optimal Distance Labeling for Interval and Circular-Arc Graphs -- Improved Approximation of the Stable Marriage Problem -- Fast Algorithms for Computing the Smallest k-Enclosing Disc -- The Minimum Generalized Vertex Cover Problem -- An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint -- On-Demand Broadcasting Under Deadline -- Improved Bounds for Finger Search on a RAM -- The Voronoi Diagram of Planar Convex Objects -- Buffer Overflows of Merging Streams -- Improved Competitive Guarantees for QoS Buffering -- On Generalized Gossiping and Broadcasting -- Approximating the Achromatic Number Problem on Bipartite Graphs -- Adversary Immune Leader Election in ad hoc Radio Networks -- Universal Facility Location -- A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm -- I/O-Efficient Undirected Shortest Paths -- On the Complexity of Approximating TSP with Neighborhoods and Related Problems -- A Lower Bound for Cake Cutting -- Ray Shooting and Stone Throwing -- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs -- Binary Space Partition for Orthogonal Fat Rectangles -- Sequencing by Hybridization in Few Rounds -- Efficient Algorithms for the Ring Loading Problem with Demand Splitting -- Seventeen Lines and One-Hundred-and-One Points -- Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves -- Contributed Papers: Engineering and Application Track -- Streaming Geometric Optimization Using Graphics Hardware -- An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals -- Experiments on Graph Clustering Algorithms -- More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling -- The Minimum Shift Design Problem: Theory and Practice -- Loglog Counting of Large Cardinalities -- Packing a Trunk -- Fast Smallest-Enclosing-Ball Computation in High Dimensions -- Automated Generation of Search Tree Algorithms for Graph Modification Problems -- Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation -- Fleet Assignment with Connection Dependent Ground Times -- A Practical Minimum Spanning Tree Algorithm Using the Cycle Property -- The Fractional Prize-Collecting Steiner Tree Problem on Trees -- Algorithms and Experiments for the Webgraph -- Finding Short Integral Cycle Bases for Cyclic Timetabling -- Slack Optimization of Timing-Critical Nets -- Multisampling: A New Approach to Uniform Sampling and Approximate Counting -- Multicommodity Flow Approximation Used for Exact Graph Partitioning -- A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs -- Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662179284
    Additional Edition: Printed edition: ISBN 9783540200642
    Language: English
    DOI: 10.1007/b13632
    URL: https://doi.org/10.1007/b13632
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 7
    Article
    Article
    Algorithms and experiments for the webgraph (2003)
    Show associated volumes
    Details
    UID:
    gbv_511472900
    ISBN: 3540200649
    In: Algorithms, Berlin : Springer, 2003, Bd. 2832.2003, S. 703-714, 3540200649
    In: volume:2832
    In: year:2003
    In: pages:703-714
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Article
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 354020064?
Did you mean 3540107649?
Did you mean 3540006249?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages