Loading…

Approximation and online algorithms 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers /

Saved in:
Bibliographic Details
Corporate Authors: WAOA 2006 Zurich, Switzerland, SpringerLink (Online service)
Other Authors: Erlebach, Thomas, Kaklamanis, Christos
Format: Conference Proceeding eBook
Language:English
Published: Berlin ; New York : Springer, ©2006.
Berlin ; New York : [2006]
Series:Lecture notes in computer science ; 4368.
Physical Description:
1 online resource (x, 344 pages) : illustrations.
Subjects:
Online Access:SpringerLink - Click here for access

MARC

LEADER 00000cam a2200000 a 4500
001 ocn185027023
003 OCoLC
005 20240223121953.0
006 m o d
007 cr cn|||||||||
008 071223s2006 gw a ob 101 0 eng d
015 |a GBA705915  |2 bnb 
016 7 |a 982335105  |2 DE-101 
016 7 |a 013647913  |2 Uk 
019 |a 80561768  |a 316696966  |a 317881691  |a 613649976  |a 739135822  |a 785781848  |a 926294399  |a 964932393  |a 1005744838  |a 1035661513  |a 1044269334  |a 1056397564  |a 1060775313  |a 1066583748  |a 1073058456  |a 1081264989  |a 1087316886  |a 1162735706  |a 1262689170 
020 |a 9783540695141 
020 |a 3540695141 
020 |a 9783540695134  |q (print) 
020 |a 3540695133  |q (print) 
035 |a (OCoLC)185027023  |z (OCoLC)80561768  |z (OCoLC)316696966  |z (OCoLC)317881691  |z (OCoLC)613649976  |z (OCoLC)739135822  |z (OCoLC)785781848  |z (OCoLC)926294399  |z (OCoLC)964932393  |z (OCoLC)1005744838  |z (OCoLC)1035661513  |z (OCoLC)1044269334  |z (OCoLC)1056397564  |z (OCoLC)1060775313  |z (OCoLC)1066583748  |z (OCoLC)1073058456  |z (OCoLC)1081264989  |z (OCoLC)1087316886  |z (OCoLC)1162735706  |z (OCoLC)1262689170 
037 |a 978-3-540-69513-4  |b Springer  |n http://www.springerlink.com 
040 |a GW5XE  |b eng  |e pn  |c GW5XE  |d GW5XE  |d GZM  |d NOC  |d BAKER  |d W2U  |d COO  |d UAB  |d DAY  |d OCLCQ  |d E7B  |d OCLCQ  |d OCLCF  |d BEDGE  |d OCLCQ  |d ITD  |d YDXCP  |d IDEBK  |d OCLCQ  |d OCLCO  |d OCL  |d OCLCO  |d EBLCP  |d OCLCQ  |d VT2  |d OCLCQ  |d ESU  |d STF  |d OCLCQ  |d CEF  |d TFW  |d U3W  |d OCLCQ  |d WYU  |d ICG  |d YOU  |d OCLCQ  |d WURST  |d OCLCQ  |d UKAHL  |d OCLCQ  |d COM  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
049 |a COM6 
050 4 |a QA76.9.A43  |b W42 2006 
072 7 |a QA  |2 lcco 
082 0 4 |a 005.1  |2 22 
111 2 |a WAOA 2006  |d (2006 :  |c Zurich, Switzerland)  |0 https://id.loc.gov/authorities/names/nb2007002230. 
245 1 0 |a Approximation and online algorithms :  |b 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers /  |c Thomas Erlebach, Christos Kaklamanis (eds.). 
246 3 0 |a WAOA 2006. 
260 |a Berlin ;  |a New York :  |b Springer,  |c ©2006. 
264 1 |a Berlin ;  |a New York :  |b Springer,  |c [2006] 
264 4 |c ©2006. 
300 |a 1 online resource (x, 344 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent. 
337 |a computer  |b c  |2 rdamedia. 
338 |a online resource  |b cr  |2 rdacarrier. 
490 1 |a Lecture notes in computer science,  |x 0302-9743 ;  |v 4368. 
504 |a Includes bibliographical references and index. 
588 0 |a Print version record. 
505 0 |a Approximation 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 |a Online algorithms  |0 https://id.loc.gov/authorities/subjects/sh98004683  |v Congresses.  |0 https://id.loc.gov/authorities/subjects/sh99001533. 
650 0 |a Mathematical optimization  |v Congresses.  |0 https://id.loc.gov/authorities/subjects/sh2008107548. 
650 6 |a Algorithmes en ligne  |v Congrès. 
650 6 |a Optimisation mathématique  |v Congrès. 
650 7 |a Informatique.  |2 eclas. 
650 7 |a Mathematical optimization.  |2 fast. 
650 7 |a Online algorithms.  |2 fast. 
653 1 |a WAOA. 
653 1 |a Approximation. 
653 0 0 |a algoritmen. 
653 0 0 |a algorithms. 
653 0 0 |a computeranalyse. 
653 0 0 |a computer analysis. 
653 0 0 |a computergrafie. 
653 0 0 |a computer graphics. 
653 0 0 |a wiskunde. 
653 0 0 |a mathematics. 
653 0 0 |a computertechnieken. 
653 0 0 |a computer techniques. 
653 0 0 |a computerwetenschappen. 
653 0 0 |a computer sciences. 
653 0 0 |a gegevensstructuren. 
653 0 0 |a data structures. 
653 0 0 |a numerieke methoden. 
653 0 0 |a numerical methods. 
653 1 0 |a Information and Communication Technology (General) 
653 1 0 |a Informatie- en communicatietechnologie (algemeen) 
655 2 |a Congress.  |0 https://id.nlm.nih.gov/mesh/D016423. 
655 7 |a proceedings (reports)  |2 aat. 
655 7 |a Conference papers and proceedings.  |2 fast. 
655 7 |a Conference papers and proceedings.  |2 lcgft  |0 https://id.loc.gov/authorities/genreForms/gf2014026068. 
655 7 |a Actes de congrès.  |2 rvmgf. 
700 1 |a Erlebach, Thomas.  |0 https://id.loc.gov/authorities/names/nb2005000268. 
700 1 |a Kaklamanis, Christos.  |0 https://id.loc.gov/authorities/names/nb2007002257. 
710 2 |a SpringerLink (Online service)  |0 https://id.loc.gov/authorities/names/no2005046756. 
776 0 8 |i Print version:  |a WAOA 2006 (2006 : Zurich, Switzerland).  |t Approximation and online algorithms.  |d Berlin ; New York : Springer, ©2006  |z 9783540695134  |z 3540695133  |w (DLC) 2006939787  |w (OCoLC)78203658. 
830 0 |a Lecture notes in computer science ;  |0 https://id.loc.gov/authorities/names/n42015162  |v 4368.  |x 0302-9743. 
907 |a .b2964219x  |b multi  |c -  |d 100215  |e 240320 
998 |a (3)cue  |a cu  |b 240227  |c m  |d z   |e -  |f eng  |g gw   |h 0  |i 2 
948 |a MARCIVE Overnight, in 2024.03 
948 |a MARCIVE Comp, in 2022.12 
948 |a MARCIVE Over, 07/2021 
948 |a MARCIVE Comp, 2018.05 
948 |a MARCIVE Comp, 2017.10 
948 |a MARCIVE August, 2017 
948 |a MARCIVE extract Aug 5, 2017 
994 |a 92  |b COM 
995 |a Loaded with m2btab.ltiac in 2024.03 
995 |a Loaded with m2btab.elec in 2024.02 
995 |a Loaded with m2btab.ltiac in 2022.12 
995 |a Loaded with m2btab.ltiac in 2021.07 
995 |a Loaded with m2btab.elec in 2021.06 
995 |a Loaded with m2btab.ltiac in 2018.06 
995 |a Loaded with m2btab.ltiac in 2017.10 
995 |a Loaded with m2btab.ltiac in 2017.08 
995 |a Loaded with m2btab.elec in 2016 
995 |a Loaded with m2btab.elec in 2016 
995 |a Loaded with m2btab.elec in 2016 
995 |a OCLC offline update by CMU 
999 |e z 
999 |a cue 
989 |d cueme  |e  - -   |f  - -   |g -   |h 0  |i 0  |j 200  |k 240227  |l $0.00  |m    |n  - -   |o -  |p 0  |q 0  |t 0  |x 0  |w SpringerLink  |1 .i150159195  |u http://ezproxy.coloradomesa.edu/login?url=https://link.springer.com/10.1007/11970125  |3 SpringerLink  |z Click here for access