Approximation and Online Algorithms Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Persiano, Giuseppe (Επιμελητής έκδοσης), Solis-Oba, Roberto (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3351
• Θέματα: Computer science.; Data structures (Computer science).; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer graphics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Numeric Computing.; Computer Graphics.; Data Structures.

The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of ?elds. WAOA 2004 took place in Bergen, Norway, from...

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

• Invited Talks
• Online Packet Switching
• Approximation Algorithms for Mixed Fractional Packing and Covering Problems
• Regular Papers
• Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees
• Online Bin Packing with Resource Augmentation
• A PTAS for Delay Minimization in Establishing Wireless Conference Calls
• This Side Up!
• Approximation Algorithm for Directed Multicuts
• Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
• Approximation Algorithms for Spreading Points
• More Powerful and Simpler Cost-Sharing Methods
• Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints
• Priority Algorithms for Graph Optimization Problems
• Pricing Network Edges to Cross a River
• Submodular Integer Cover and Its Application to Production Planning
• Stochastic Online Scheduling on Parallel Machines
• A -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path
• Order-Preserving Transformations and Greedy-Like Algorithms
• Off-line Admission Control for Advance Reservations in Star Networks
• Joint Base Station Scheduling
• Universal Bufferless Routing
• Strong Colorings of Hypergraphs
• Deterministic Monotone Algorithms for Scheduling on Related Machines
• Better Bounds for Minimizing SONET ADMs.