Liebe Besucherinnen und Besucher,
aufgrund unseres Sommerfestes sind wir am 03. September 2026 bis 14 Uhr erreichbar. Am 04. September 2026 sind wir wieder wie gewohnt für Sie da. Vielen Dank für Ihr Verständnis.
Ihr Team von Sack Fachmedien
7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers
Buch, Englisch, 255 Seiten, Gewicht: 416 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-642-12449-5
Verlag: Springer
2009.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik Mathematik Mathematische Analysis Moderne Anwendungen der Analysis
- Mathematik | Informatik EDV | Informatik Professionelle Anwendung
Weitere Infos & Material
WAOA 2009.- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems.- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.- Price Fluctuations: To Buy or to Rent.- Approximation Algorithms for Multiple Strip Packing.- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.- Longest Wait First for Broadcast Scheduling [Extended Abstract].- The Routing Open Shop Problem: New Approximation Algorithms.- On the Price of Stability for Undirected Network Design.- Finding Dense Subgraphs in G(n,1/2).- Parameterized Analysis of Paging and List Update Algorithms.- Online Scheduling of Bounded Length Jobs to Maximize Throughput.- On the Additive Constant of the k-Server Work Function Algorithm.- A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs.- Guard Games on Graphs: Keep the Intruder Out!.- Between a Rock and a Hard Place: The Two-to-One Assignment Problem.- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width.- Online Minimization Knapsack Problem.- Optimization Problems in Multiple Subtree Graphs.- Multi-Criteria TSP: Min and Max Combined.- Packet Routing: Complexity and Algorithms.- Minimal Cost Reconfiguration of Data Placement in Storage Area Network.- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing.
