| Description |
1 online resource (xix, 813 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 6942 |
|
LNCS sublibrary, SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6942. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Machine generated contents note: Approximation Algorithms I -- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints / Akiyoshi Shioura -- Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph / Loukas Georgiadis -- Improved Approximation Algorithms for Bipartite Correlation Clustering / Anke van Zuylen -- Bounds on Greedy Algorithms for MAX SAT / Matthias Poloczek -- Computational Geometry I -- Approximating Minimum Manhattan Networks in Higher Dimensions / Alexander Wolff -- On Isolating Points Using Disks / Kasturi Varadarajan -- Output-Sensitive Approach for the L1/L[∞] k-Nearest-Neighbor Voronoi Diagram / Der-Tsai Lee -- Can Nearest Neighbor Searching Be Simple and Always Fast? / Raimund Seidel -- Game Theory -- On the Approximation Performance of Fictitious Play in Finite Games / Carmine Ventre -- How Profitable Are Strategic Behaviors in a Market? / Jie Zhang -- Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms / Evangelia Pyrga -- Graph Algorithms I -- Algorithms for Finding a Maximum Non-k-linked Graph / Yuichi Yoshida -- O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs / Peter Widmayer -- Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time / Piotr Sankowski -- Stable Matchings and Auctions -- Near-Popular Matchings in the Roommates Problem / Telikepalli Kavitha -- Hospitals/Residents Problem with Quota Lower Bounds / Shuichi Miyazaki -- Multi-parameter Mechanism Design under Budget and Matroid Constraints / Angelina Vidali -- Optimization -- Quantified Linear Programs: A Computational Study / Jan Wolf -- Recoverable Robustness by Column Generation / J.A. Hoogeveen -- Passenger Flow-Oriented Train Disposition / Mathias Schnee -- Online Algorithms I |
|
Note continued: One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay / Lukasz Jez -- Better Bounds for Incremental Frequency Allocation in Bipartite Graphs / Jiri Sgall -- Two-Bounded-Space Bin Packing Revisited / Gerhard J. Woeginger -- Exponential-Time Algorithms -- Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs / Romeo Rizzi -- Exact Algorithm for the Maximum Induced Planar Subgraph Problem / Yngve Villanger -- Scheduling Partially Ordered Jobs Faster Than 2n / Jakub Onufry Wojtaszczyk -- Online Algorithms I -- AdCell: Ad Allocation in Cellular Networks / Barna Saha -- Submodular Max-SAT / Ran Roth -- On Variants of the Matroid Secretary Problem / Jan Vondrak -- Hitting Sets Online and Vertex Ranking / Shakhar Smorodinsky -- Parameterized Algorithms -- Fast Sub-exponential Algorithms and Compactness in Planar Graphs / Dimitrios M. Thilikos -- ̂ Isomorphism of (Mis)Labeled Graphs / Pascal Schweitzer -- Paths, Flowers and Vertex Cover / Saket Saurabh -- Hitting and Harvesting Pumpkins / Stephan Thomasse -- Best Paper Session -- Deterministic Discrepancy Minimization / Joel Spencer -- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic / Pawel Gawrychowski -- Graph Algorithms I -- Experimental Study on Approximating K Shortest Simple Paths / Liam Roditty -- Scope-Based Route Planning / Ondrej Moris -- Maximum Flows by Incremental Breadth-First Search / Renato F. Werneck -- Engineering Multilevel Graph Partitioning Algorithms / Christian Schulz -- Computational Geometry II -- Nearly Optimal Algorithm for Finding L1 Shortest Paths among Polygonal Obstacles in the Plane / Haitao Wang -- Motion Planning via Manifold Samples / Dan Halperin -- Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane / Mudassir Shabbir |
|
Note continued: Cover-Decomposition and Polychromatic Numbers / Alex Scott |
| Summary |
This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems |
| Notes |
International conference proceedings |
| Bibliography |
Includes bibliographical references and author index |
| Subject |
Computer algorithms -- Congresses
|
|
Informatique.
|
|
Computer algorithms
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Demetrescu, Camil.
|
|
Magnús M. Halldórsson.
|
| ISBN |
9783642237195 |
|
3642237193 |
|
