Approximation and Online Algorithms 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Kaklamanis, Christos (Επιμελητής έκδοσης), Skutella, Martin (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 4927
• Θέματα: 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.

The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2007 took place in Eilat, Israel, during Octob...

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

• Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
• Improved Lower Bounds for Non-utilitarian Truthfulness
• Buyer-Supplier Games: Optimization over the Core
• Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
• A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
• Online Algorithm for Parallel Job Scheduling and Strip Packing
• Geometric Spanners with Small Chromatic Number
• Approximating Largest Convex Hulls for Imprecise Points
• A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
• Covering the Edges of Bipartite Graphs Using K 2,2 Graphs
• On Min-Max r-Gatherings
• On the Max Coloring Problem
• Full and Local Information in Distributed Decision Making
• The Minimum Substring Cover Problem
• A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
• On the Online Unit Clustering Problem
• Better Bounds for Incremental Medians
• Minimum Weighted Sum Bin Packing
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• A Randomized Algorithm for Two Servers in Cross Polytope Spaces
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Online Rectangle Filling.