1 option
Approximation and Online Algorithms : 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers / edited by Thomas Erlebach, Christos Kaklamanis.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4368.
- Theoretical Computer Science and General Issues ; 4368
- Language:
- English
- Subjects (All):
- Software engineering.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Numerical analysis.
- Computer graphics.
- Data structures (Computer science).
- Software Engineering/Programming and Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Numeric Computing.
- Computer Graphics.
- Data Structures.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Numeric Computing.
- Computer Graphics.
- Data Structures.
- Physical Description:
- 1 online resource (X, 346 pages).
- Edition:
- First edition 2007.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69514-1
- 9783540695141
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.