Approximation and Online Algorithms [[electronic resource] ] : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers / / edited by Evripidis Bampis, Klaus Jansen

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
• Edizione: 1st ed. 2010.
• Descrizione fisica: 1 online resource (X, 255 p. 23 illus.)
• Disciplina: 005.11
• Soggetto topico: Computer programming; Computer science; Application software; Algorithms; Computer science—Mathematics; Discrete mathematics; Numerical analysis; Programming Techniques; Theory of Computation; Computer and Information Systems Applications; Discrete Mathematics in Computer Science; Numerical Analysis
• Persona (resp. second.): BampisEvripidis; JansenKlaus
• Note generali: International conference proceedings.
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Titolo autorizzato: Approximation and Online Algorithms
• ISBN: 1-280-38624-X; 9786613564160; 3-642-12450-X
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465919903316
• Lo trovi qui: Univ. di Salerno
• Serie: Theoretical Computer Science and General Issues, . 2512-2029 ; ; 5893