Central Library

Normal view MARC view ISBD view

Approximation and Online Algorithms [electronic resource] : 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers / edited by Thomas Erlebach, Christos Kaklamanis.

Contributor(s): Erlebach, Thomas [editor.] | Kaklamanis, Christos [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 4368Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: X, 346 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540695141.Subject(s): 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 ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.1 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.