Goran Konjevod, Sven O. Krumke, Madhav V. Marathe  Home/Search
Context
Related
| zib.de/krumke/Post...servicetree.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: zib.de/krumke/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we study a graph-theoretic problem that aims to simultaneously address a network design task and a location-theoretic constraint. The Budget Constrained Connected Median Problem is the following: We are given an undirected graph G = (V; E) with two different edge-weight functions c (modeling the construction or communication cost) and d (modeling the... (Update)
Similar documents (at the sentence level):
25.0%: Budget Constrained Minimum Cost Connected Medians - Konjevod, Krumke, Marathe (2000) (Correct)
Active bibliography (related documents): More All
0.4: Approximation Algorithms for the Traveling Purchaser Problem.. - Ravi, Salman (1999) (Correct)
0.4: A polylogarithmic approximation algorithm for the group.. - Garg, Konjevod, Ravi (1998) (Correct)
0.3: Flow Improvement and Network Flows with Fixed Costs - Krumke, Noltemeier.. (1998) (Correct)
Similar documents based on text: More All
0.3: Cv - Konjevod (Correct)
0.3: Approximation Algorithms for the Covering Steiner Problem - Konjevod, Ravi, Srinivasan (2000) (Correct)
0.2: On the Integrality Gap of a Natural Formulation of .. - Garg, Khandekar.. (2001) (Correct)
BibTeX entry: (Update)
@inproceedings{ konjevod00budget,
author = "Goran Konjevod and Sven Oliver Krumke and Madhav V. Marathe",
title = "Budget Constrained Minimum Cost Connected Medians",
booktitle = "Workshop on Graph-Theoretic Concepts in Computer Science",
pages = "267-278",
year = "2000",
url = "citeseer.ist.psu.edu/600573.html" }
Citations (may not include all citations):686 A guide to the theory of NP- completeness (context) - Garey, Johnson et al. - 1979
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lovasz et al. - 1988
226 for approximating set cover (context) - Feige, of - 1996
187 Polynomial-time approximation schemes for euclidean TSP and .. - Arora - 1998
101 Competitive algorithms for distributed data management - Bartal, Fiat et al. - 1995
93 Comparative models of the file assignment problem (context) - Dowdy, Foster - 1982
82 Improved low-degree testing and its applications - Arora, Sudan - 1997
71 Mathematical techniques in multisensor data fusion (context) - Hall - 1992
50 approximations with minimum packing constraint violation (context) - Lin, Vitter - 1992
48 Approximation algorithms for geometric tour and network desi.. - Mata, Mitchell - 1995
47 Bicriteria network design problems - Marathe, Ravi et al. - 1998
44 Rounding via tree: Deterministic approximation algorithms fo.. - Charikar, Chekuri et al. - 1998
42 line distributed data management (context) - Lund, Reingold et al. - 1994
37 A polylogarithmic approximation algorithm for the group stei.. - Garg, Konjevod et al. - 1998
36 Spanning trees short or small - Ravi, Sundaram et al. - 1996
21 The multicast policy and its relationship to replicated data.. (context) - Wolfson, Milo - 1991
20 Approximation algorithms for the geometric covering salesman.. - Arkin, Hassin - 1994
14 with applications to automatic optical inspection (context) - Iwano, Raghavan et al. - 1994
13 Positioning guards at fixed height above a terrain -- an opt.. - Eidenbenz, Stamm et al. - 1998
11 approximation algorithm for the k-MST problem (context) - Arora, Karakostas - 2000
9 Approximation algorithms for the traveling purchaser problem.. - Ravi, Salman - 1999
7 Service constrained network design problems - Marathe, Ravi et al. - 1996
4 Improved results for service constrained network design prob.. (context) - Marathe, Ravi et al. - 1998
4 The covering salesman problem (context) - Current, Schilling - 1989
3 Designing special communication networks with the traveling .. (context) - Voss - 1990
3 the approximability of location and network design problems - Krumke - 1996
2 Competitve distributed file allocation (context) - Awerbuch, Bartal et al. - 1993
1 approximation algorithm for the minimum tree spanning k vert.. (context) - Garg - 1996
Documents on the same site (http://www.zib.de/krumke/publications.html): More
Compact Location Problems - Krumke, Marathe, Noltemeier.. (1997) (Correct)
Complexity and Approximability of Certain Bicriteria .. - Krumke, Noltemeier, .. (Correct)
Compact Location Problems (Extended Abstract) - Radhakrishnan, Krumke.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC