Approximation and online algorithms :first international workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003 : revised papers

• 其他作者: Jansen, Klaus. , Solis-Oba, Roberto.
• 出版: Berlin ;New York : Springer ©2004.
• 稽核項: 1 online resource (viii, 268 pages) :illustrations.
• 叢書名: Lecture notes in computer science,2909
• 標題: COMPUTERS Programming -- Open Source. , COMPUTERS , Algorithme en ligne. , COMPUTERS Software Development & Engineering -- Tools. , Software Development & EngineeringGeneral. , Online algorithms , Mathematical optimization. , Electronic books. , Budapest (2003) , Mathematical optimization Congresses. , Kongress , COMPUTERS Software Development & Engineering -- General. , Optimisation mathématique Congrès. , Mathematical optimization , Electronic book. , Algorithme d'approximation. , Conference papers and proceedings. , Algorithmes en ligne , Optimisation mathématique , Online-Algorithmus , Online algorithms. , Software Development & EngineeringTools. , Online algorithms Congresses. , Optimisation mathématique. , Approximation , Algorithmes en ligne Congrès. , ProgrammingOpen Source.
• ISBN: 1280306971 , 9781280306976
• ISBN: 3540210792 , 9783540210795 , 0302-9743 ;
• 試查全文@TNUA:
  
• 附註: Includes bibliographical references and index. Contributed 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.
• 摘要: This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Approximation and Online Algorithms, WAOA 2003, held in Budapest, Hungary in September 2003. The 19 revised full papers presented together with 5 invited abstracts of the related ARACNE mini-symposium were carefully selected from 41 submissions during two rounds of reviewing and improvement. Among the topics addressed are competitive analysis, inapproximability results, randomization techniques, approximation classes, scheduling, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and financial problems.
• 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=127789
• 系統號: 005307093
• 資料類型: 電子書
• 讀者標籤: 需登入
• 引用網址: 複製連結
• 目前引用數