Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings > An Approximation Algorithm for the Minimum Latency Set Cover Problem
Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings |
Gerth S. Brodal; Stefano Leonardi
Springer Berlin Heidelberg
Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
An Approximation Algorithm for the Minimum Latency Set Cover Problem
Authors

Refael Hassin; Asaf Levin

ARI Id

1664699835477_2788483

Access

Not Available Free

Pages

726-733

DOI

10.1007/11561071_64

Chapter URL

https://rd.springer.com/chapter/10.1007/11561071_64

Table of Contents of Book
Showing 1 to 20 of 80 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Designing Reliable Algorithms in Unreliable Memories
Irene Finocchi; Fabrizio Grandoni; Giuseppe F. Italiano
1-8
From Balanced Graph Partitioning to Balanced Metric Labeling
Joseph Naor
9-9
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism
Cristopher Moore
10-10
Exploring an Unknown Graph Efficiently
Rudolf Fleischer; Gerhard Trippen
11-22
Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio
Stefan Rührup; Christian Schindelhauer
23-34
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut
Garima Batra; Naveen Garg; Garima Gupta
35-46
Relax-and-Cut for Capacitated Network Design
Georg Kliewer; Larissa Timajev
47-58
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games, ,
George Christodoulou; Elias Koutsoupias
59-70
The Complexity of Games on Highly Regular Graphs
Konstantinos Daskalakis; Christos H. Papadimitriou
71-82
Computing Equilibrium Prices: Does Theory Meet Practice?
Bruno Codenotti; Benton McCune; Rajiv Raman; Kasturi Varadarajan
83-94
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions
Frederic Dorn; Eelko Penninkx; Hans L. Bodlaender; Fedor V. Fomin
95-106
An Algorithm for the SAT Problem for Formulae of Linear Length
Magnus Wahlström
107-118
Linear-Time Enumeration of Isolated Cliques
Hiro Ito; Kazuo Iwama; Tsuyoshi Osumi
119-130
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
Sergio Cabello; Bojan Mohar
131-142
Delineating Boundaries for Imprecise Regions
Iris Reinbacher; Marc Benkert; Marc van Kreveld; Joseph S. B. Mitchell; Alexander Wolff
143-154
Exacus: Efficient and Exact Algorithms for Curves and Surfaces
Eric Berberich; Arno Eigenwillig; Michael Hemmer; Susan Hert; Lutz Kettner; Kurt Mehlhorn et al.
155-166
Min Sum Clustering with Penalties
Refael Hassin; Einat Or
167-178
Improved Approximation Algorithms for Metric Max TSP
Zhi-Zhong Chen; Takayuki Nagoya
179-190
Unbalanced Graph Cuts
Ara Hayrapetyan; David Kempe; Martin Pál; Zoya Svitkina
191-202
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 80 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings