Approximation and Online Algorithms 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006. Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Erlebach, Thomas (Επιμελητής έκδοσης), Kaklamanis, Christos (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
• Σειρά: Lecture Notes in Computer Science, 4368
• Θέματα: Computer science.; Software engineering.; Data structures (Computer science).; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Software Engineering/Programming and Operating Systems.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Numeric Computing.; Computer Graphics.; Data Structures.

Πίνακας περιεχομένων:

• 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.