Approximation and Online Algorithms 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers /
Approximation and Online Algorithms 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers / [electronic resource] :
edited by Thomas Erlebach, Christos Kaklamanis.
- 1st ed. 2007.
- X, 346 p. online resource.
- Theoretical Computer Science and General Issues, 4368 2512-2029 ; .
- Theoretical Computer Science and General Issues, 4368 .
Approximation Algorithms for Scheduling Problems with Exact Delays -- Bidding to the Top: VCG and Equilibria of Position-Based Auctions -- Coping with Interference: From Maximum Coverage to Planning Cellular Networks -- Online Dynamic Programming Speedups -- Covering Many or Few Points with Unit Disks -- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems -- Online k-Server Routing Problems -- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem -- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs -- A Randomized Algorithm for Online Unit Clustering -- On Hierarchical Diameter-Clustering, and the Supplier Problem -- Bin Packing with Rejection Revisited -- On Bin Packing with Conflicts -- Approximate Distance Queries in Disk Graphs -- Network Design with Edge-Connectivity and Degree Constraints -- Approximating Maximum Cut with Limited Unbalance -- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems -- Improved Online Hypercube Packing -- Competitive Online Multicommodity Routing -- The k-Allocation Problem and Its Variants -- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions -- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set -- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search -- Approximation Algorithms for Multi-criteria Traveling Salesman Problems -- The Survival of the Weakest in Networks -- Online Distributed Object Migration.
9783540695141
10.1007/11970125 doi
Software engineering.
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Numerical analysis.
Computer graphics.
Artificial intelligence--Data processing.
Software Engineering.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Graphics.
Data Science.
QA76.758
005.1
Approximation Algorithms for Scheduling Problems with Exact Delays -- Bidding to the Top: VCG and Equilibria of Position-Based Auctions -- Coping with Interference: From Maximum Coverage to Planning Cellular Networks -- Online Dynamic Programming Speedups -- Covering Many or Few Points with Unit Disks -- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems -- Online k-Server Routing Problems -- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem -- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs -- A Randomized Algorithm for Online Unit Clustering -- On Hierarchical Diameter-Clustering, and the Supplier Problem -- Bin Packing with Rejection Revisited -- On Bin Packing with Conflicts -- Approximate Distance Queries in Disk Graphs -- Network Design with Edge-Connectivity and Degree Constraints -- Approximating Maximum Cut with Limited Unbalance -- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems -- Improved Online Hypercube Packing -- Competitive Online Multicommodity Routing -- The k-Allocation Problem and Its Variants -- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions -- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set -- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search -- Approximation Algorithms for Multi-criteria Traveling Salesman Problems -- The Survival of the Weakest in Networks -- Online Distributed Object Migration.
9783540695141
10.1007/11970125 doi
Software engineering.
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Numerical analysis.
Computer graphics.
Artificial intelligence--Data processing.
Software Engineering.
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Graphics.
Data Science.
QA76.758
005.1