Thomas Erlebach
Approximation and Online Algorithms: 4th International Workshop, Waoa 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Thomas Erlebach

Name: Approximation and Online Algorithms: 4th International Workshop, Waoa 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Price: 8536 JPY
Availability: OutOfStock
Author: Thomas Erlebach

価格

¥ 8.536

税抜

遠隔倉庫からの取り寄せ

発送予定日年10月28日 - 年11月9日

Thomas Erlebach の新しいリリースのお知らせを受け取る

お客様の声：

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

EU消費者保護法に基づく14日間の返品ポリシー

Trustpilotで高評価

iMusicのウィッシュリストに追加

まだ評価がありません

Approximation and Online Algorithms: 4th International Workshop, Waoa 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues

Thomas Erlebach

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions.

Marc Notes: Based on publisher-provided data.; Includes bibliographical references and index. Table of Contents: 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.

メディア	書籍 Paperback Book (ソフトカバーで背表紙を接着した本)
リリース済み	2007年1月3日
ISBN13	9783540695134
出版社	Springer-Verlag Berlin and Heidelberg Gm
ページ数	346
寸法	156 × 234 × 19 mm · 508 g
言語	フランス語
編集者	Erlebach, Thomas
編集者	Kaklamanis, Christos