|
|
|
|
| LEADER |
03463nam a22005655i 4500 |
| 001 |
978-3-642-12450-1 |
| 003 |
DE-He213 |
| 005 |
20151204144356.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100509s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642124501
|9 978-3-642-12450-1
|
| 024 |
7 |
|
|a 10.1007/978-3-642-12450-1
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 245 |
1 |
0 |
|a Approximation and Online Algorithms
|h [electronic resource] :
|b 7th International Workshop,WAOA 2009, Copenhagen Denmark, September 10-11, 2009. Revised Papers /
|c edited by Evripidis Bampis, Klaus Jansen.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
|
|
|a X, 255 p. 23 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5893
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Application software.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Computer Applications.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Numeric Computing.
|
| 700 |
1 |
|
|a Bampis, Evripidis.
|e editor.
|
| 700 |
1 |
|
|a Jansen, Klaus.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642124495
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5893
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12450-1
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
