000 03903nam a22006255i 4500
001 978-3-642-12450-1
003 DE-He213
005 20240730181408.0
007 cr nn 008mamaa
008 100509s2010 gw | s |||| 0|eng d
020 _a9783642124501
_9978-3-642-12450-1
024 7 _a10.1007/978-3-642-12450-1
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aApproximation and Online Algorithms
_h[electronic resource] :
_b7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers /
_cedited by Evripidis Bampis, Klaus Jansen.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aX, 255 p. 23 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5893
505 0 _aWAOA 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 _aComputer programming.
_94169
650 0 _aComputer science.
_99832
650 0 _aApplication software.
_9124679
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 1 4 _aProgramming Techniques.
_9124680
650 2 4 _aTheory of Computation.
_9124681
650 2 4 _aComputer and Information Systems Applications.
_9124682
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
700 1 _aBampis, Evripidis.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9124683
700 1 _aJansen, Klaus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9124684
710 2 _aSpringerLink (Online service)
_9124685
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642124495
776 0 8 _iPrinted edition:
_z9783642124518
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5893
_9124686
856 4 0 _uhttps://doi.org/10.1007/978-3-642-12450-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90872
_d90872