000			03682nam a22005775i 4500
001			978-3-540-69514-1
003			DE-He213
005			20160624102057.0
007			cr nn 008mamaa
008			110117s2007 gw | s |||| 0|eng d
020			_a9783540695141 _9978-3-540-69514-1
024	7		_a10.1007/11970125 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aApproximation and Online Algorithms _h[electronic resource] : _b4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006. Revised Papers / _cedited by Thomas Erlebach, Christos Kaklamanis.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
300			_aX, 346 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v4368
505	0		_aApproximation Algorithms for Scheduling Problems with Exact Delays -- Bidding to the Top: VCG and Equilibria of Position-Based Auctions -- Coping with Interference: From Maximum Coverage to Planning Cellular Networks -- Online Dynamic Programming Speedups -- Covering Many or Few Points with Unit Disks -- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems -- Online k-Server Routing Problems -- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem -- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs -- A Randomized Algorithm for Online Unit Clustering -- On Hierarchical Diameter-Clustering, and the Supplier Problem -- Bin Packing with Rejection Revisited -- On Bin Packing with Conflicts -- Approximate Distance Queries in Disk Graphs -- Network Design with Edge-Connectivity and Degree Constraints -- Approximating Maximum Cut with Limited Unbalance -- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems -- Improved Online Hypercube Packing -- Competitive Online Multicommodity Routing -- The k-Allocation Problem and Its Variants -- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions -- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set -- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search -- Approximation Algorithms for Multi-criteria Traveling Salesman Problems -- The Survival of the Weakest in Networks -- Online Distributed Object Migration.
650		0	_aComputer science.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aElectronic data processing.
650		0	_aComputational complexity.
650		0	_aComputer graphics.
650		0	_aAlgorithms.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aNumeric Computing.
650	2	4	_aComputer Graphics.
650	2	4	_aData Structures.
650	2	4	_aAlgorithms.
700	1		_aErlebach, Thomas. _eeditor.
700	1		_aKaklamanis, Christos. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540695134
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v4368
856	4	0	_uhttp://dx.doi.org/10.1007/11970125
942			_2EBK7232 _cEBK
999			_c36526 _d36526