Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings > An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings |
Tiziana Calamoneri; Irene Finocchi; Giuseppe F. Italiano
Springer Berlin Heidelberg
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Authors

Ming-Yang Kao; Manan Sanghi

ARI Id

1674219820603_3433246

Access

Not Available Free

Pages

223-235

DOI

10.1007/11758471_23

Chapter URL

https://rd.springer.com/chapter/10.1007/11758471_23

Table of Contents of Book
Showing 1 to 20 of 38 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Reliable and Efficient Geometric Computing
Kurt Mehlhorn
1-2
Beware of the Model: Reflections on Algorithmic Research
Franco P. Preparata
3-4
On Search Problems in Complexity Theory and in Logic (Abstract)
Pavel Pudlák
5-5
Covering a Set of Points with a Minimum Number of Lines
Magdalene Grantson; Christos Levcopoulos
6-17
Approximation Algorithms for Capacitated Rectangle Stabbing
Guy Even; Dror Rawitz; Shimon (Moni) Shahar
18-29
In-Place Randomized Slope Selection
Henrik Blunck; Jan Vahrenhold
30-41
Quadratic Programming and Combinatorial Minimum Weight Product Problems
Walter Kern; Gerhard Woeginger
42-49
Counting All Solutions of Minimum Weight Exact Satisfiability
Stefan Porschen
50-59
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Evgeny Dantsin; Edward A. Hirsch; Alexander Wolpert
60-68
Network Discovery and Verification with Distance Queries
Thomas Erlebach; Alexander Hall; Michael Hoffmann; Matúš Mihaľák
69-80
Deciding the FIFO Stability of Networks in Polynomial Time
Maik Weinard
81-92
Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates
Dimitrios Koukopoulos; Stavros D. Nikolopoulos
93-104
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Friedrich Eisenbrand; Edda Happ
105-114
Gathering Algorithms on Paths Under Interference Constraints
Jean-Claude Bermond; Ricardo Corrêa; Minli Yu
115-126
On the Hardness of Range Assignment Problems
Bernhard Fuchs
127-138
Black Hole Search in Asynchronous Rings Using Tokens
S. Dobrev; R. Královič; N. Santoro; W. Shi
139-150
On Broadcast Scheduling with Limited Energy
Christian Gunia
151-162
A Near Optimal Scheduler for On-Demand Data Broadcasts
Hing-Fung Ting
163-174
Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines
Yvonne Bleischwitz; Burkhard Monien
175-186
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 38 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings