Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.orl.2003.11.010 | Oper. Res. Lett. |
Keywords | Field | DocType |
clustering.,maximum weight tree,approximation algorithms,constant factor approximation algorithm,location routing,min-max tree,clustering,salesperson problem,objective function,graphs,traveling salesperson problem,upper bound | Approximation algorithm,Discrete mathematics,Graph,Mathematical optimization,Combinatorics,Upper and lower bounds,Cluster analysis,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 4 | Operations Research Letters |
Citations | PageRank | References |
48 | 2.28 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Even | 1 | 100 | 7.19 |
| Naveen Garg | 2 | 2181 | 178.27 |
| Jochen Könemann | 3 | 158 | 9.98 |
| R. Ravi | 4 | 2898 | 275.40 |
| A. Sinha | 5 | 49 | 2.65 |