Min-max tree covers of graphs

G. Even; N. Garg; J. Könemann; R. Ravi; A. Sinha

doi:10.1016/j.orl.2003.11.010

Min-max tree covers of graphs

G. Even, N. Garg, J. Könemann, R. Ravi, A. Sinha^*

^*Corresponding author for this work

School of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location routing and traveling salesperson problems.

Original language	English
Pages (from-to)	309-315
Number of pages	7
Journal	Operations Research Letters
Volume	32
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2003.11.010
State	Published - Jul 2004

Keywords

Approximation algorithms
Clustering
Graphs
Location routing

Access to Document

10.1016/j.orl.2003.11.010

Cite this

@article{59013871bfe8467f827aa3915b0a9121,

title = "Min-max tree covers of graphs",

abstract = "We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location routing and traveling salesperson problems.",

keywords = "Approximation algorithms, Clustering, Graphs, Location routing",

author = "G. Even and N. Garg and J. K{\"o}nemann and R. Ravi and A. Sinha",

year = "2004",

month = jul,

doi = "10.1016/j.orl.2003.11.010",

language = "אנגלית",

volume = "32",

pages = "309--315",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Min-max tree covers of graphs

AU - Even, G.

AU - Garg, N.

AU - Könemann, J.

AU - Ravi, R.

AU - Sinha, A.

PY - 2004/7

Y1 - 2004/7

N2 - We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location routing and traveling salesperson problems.

AB - We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location routing and traveling salesperson problems.

KW - Approximation algorithms

KW - Clustering

KW - Graphs

KW - Location routing

UR - http://www.scopus.com/inward/record.url?scp=2042506399&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2003.11.010

DO - 10.1016/j.orl.2003.11.010

M3 - מאמר

AN - SCOPUS:2042506399

VL - 32

SP - 309

EP - 315

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -

Min-max tree covers of graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this