LEADER 06243nam 22008415 450 001 996465433003316 005 20200706172349.0 010 $a1-280-30697-1 010 $a9786610306978 010 $a3-540-24592-8 024 7 $a10.1007/b95598 035 $a(CKB)1000000000212310 035 $a(DE-He213)978-3-540-24592-6 035 $a(SSID)ssj0000104932 035 $a(PQKBManifestationID)11130722 035 $a(PQKBTitleCode)TC0000104932 035 $a(PQKBWorkID)10108832 035 $a(PQKB)10743260 035 $a(MiAaPQ)EBC3088034 035 $a(PPN)155227459 035 $a(EXLCZ)991000000000212310 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aApproximation and Online Algorithms$b[electronic resource] $eFirst International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers /$fedited by Klaus Jansen, Roberto Solis-Oba 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (VIII, 268 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2909 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-21079-2 320 $aIncludes bibliographical references and index. 327 $aContributed Talks -- Online Coloring of Intervals with Bandwidth -- Open Block Scheduling in Optical Communication Networks -- Randomized Priority Algorithms -- Tradeoffs in Worst-Case Equilibria -- Load Balancing of Temporary Tasks in the ? p Norm -- Simple On-Line Algorithms for Call Control in Cellular Networks -- Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees -- A -Approximation Algorithm for Scheduling Identical Malleable Tasks -- Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation -- Scheduling AND/OR-Networks on Identical Parallel Machines -- Combinatorial Interpretations of Dual Fitting and Primal Fitting -- On the Approximability of the Minimum Fundamental Cycle Basis Problem -- The Pledge Algorithm Reconsidered under Errors in Sensors and Motion -- The Online Matching Problem on a Line -- How to Whack Moles -- Online Deadline Scheduling: Team Adversary and Restart -- Minimum Sum Multicoloring on the Edges of Trees -- Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms -- On-Line Extensible Bin Packing with Unequal Bin Sizes -- ARACNE Talks -- Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms -- Power Consumption Problems in Ad-Hoc Wireless Networks -- A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem -- Disk Graphs: A Short Survey -- Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems. 330 $aThe Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ing from a variety of ?elds. The workshop also covered experimental research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis,inapproximab- ityresults,randomizationtechniques,approximationclasses,scheduling,coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and ?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2909 606 $aSoftware engineering 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aNumeric Computing. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a005.1 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSolis-Oba$b Roberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWAOA 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465433003316 996 $aApproximation and Online Algorithms$92568529 997 $aUNISA