|
|
|
|
| LEADER |
00000nam a22000003i 4500 |
| 001 |
ebs656604e |
| 003 |
EBZ |
| 006 |
m o d |||||| |
| 007 |
cr|unu|||||||| |
| 008 |
100509s2010 gw | o |||| 0|eng d |
| 020 |
|
|
|z 9783642124495
|
| 020 |
|
|
|a 9781280386244 (online)
|
| 020 |
|
|
|a 9783642124501 (online)
|
| 035 |
|
|
|a (EBZ)ebs656604e
|
| 040 |
|
|
|d EBZ
|
| 042 |
|
|
|a msc
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 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.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|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 programming.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Application software.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 700 |
1 |
|
|a Bampis, Evripidis.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Jansen, Klaus.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer English/International eBooks 2010 - Full Set
|d Springer Nature
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642124495
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642124518
|
| 776 |
1 |
|
|t Approximation and Online Algorithms
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5893
|
| 856 |
4 |
0 |
|y Access Content Online(from Springer English/International eBooks 2010 - Full Set)
|u https://ezproxy.msu.edu/login?url=https://link.springer.com/10.1007/978-3-642-12450-1
|z Springer English/International eBooks 2010 - Full Set: 2010
|
