Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Garg, Naveen
Konjevod, Goran
Ravi, R.

dblp
dblp
dblp



BibTeX cite key*:

GargKonjevodRavi2000

Title

Title*:

Approximation algorithm for the group Steiner tree problem

Journal

Journal Title*:

Journal of Algorithms

Journal's URL:

http://www.academicpress.com/www/journal/al.htm

Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

Academic Press

Publisher's URL:

http://www.academicpress.com/

Publisher's
Address:

San Diego, USA

ISSN:

0196-6774

Vol, No, pp, Date

Volume*:

37

Number:

1

Publishing Date:

2000

Pages*:

66-84

Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem is to find a minimum-weight subgraph which contains at least one vertex from each group. We give a randomized algorithm with a polylogarithmic approximation guarantee for the group Steiner tree problem. The previous best approximation guarantee was O (i2k1/i) in time O (nik2i) (Charikar, Chekuri, Goel, and Guha). Our algorithm also improves existing approximation results for network design problems with location-based constraints and for the symmetric generalized traveling salesman problem

URL for the Abstract:


Categories,
Keywords:

Steiner tree, approximation algorithms, set cover, randomized rounding, network design, tree decompositions

HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:

@ARTICLE{GargKonjevodRavi2000,
AUTHOR = {Garg, Naveen and Konjevod, Goran and Ravi, R.},
TITLE = {Approximation algorithm for the group {Steiner} tree problem},
JOURNAL = {Journal of Algorithms},
PUBLISHER = {Academic Press},
YEAR = {2000},
NUMBER = {1},
VOLUME = {37},
PAGES = {66--84},
ADDRESS = {San Diego, USA},
ISBN = {0196-6774},
}


Entry last modified by Uwe Brahm, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Anja Becker
Created
03/14/2001 03:47:04 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Uwe Brahm
Anja Becker
Anja Becker
Anja Becker
Anja Becker
Edit Dates
05/02/2001 11:59:44 AM
04.04.2001 15:54:10
30.03.2001 15:13:40
21.03.2001 14:25:05
14.03.2001 15:50:15