๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved approximation ratio for the minimum latency problem

โœ Scribed by Michel Goemans; Jon Kleinberg

Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
860 KB
Volume
82
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Better Approximation Ratio for the Min
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
โœ Cristina G Fernandes ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo

An improved approximation scheme for the
An improved approximation scheme for the Group Steiner Problem
โœ C. S. Helvig; Gabriel Robins; Alexander Zelikovsky ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 322 KB ๐Ÿ‘ 1 views

the Group Steiner Problem asks for a minimumcost tree which contains at least one node from each group N i N i N i . In this paper, we give polynomial-time O O O(k k k )approximation algorithms for any fixed > > > 0. This result improves the previously known O O O(k k k)-approximation. We also apply