Goran Konjevod, Sven O. Krumke, Madhav Marathe  Home/Search
Context
Related
| zib.de/pub/zibpublicatio...ZR0010.ps Cached: 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.
PS.gz PS Image Update HelpFrom: zib.de/paperweb...=2000&pubtype=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several practical instances of network design problems require the network to satisfy multiple constraints. In this paper, we address the Budget Constrained Connected Median Problem: 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 service distance), and a bound B on the total service distance. The goal is to find a subtree T of G with minimum c-cost c(T ) subject to the constraint that... (Update)
Similar documents based on text: More All
0.7: Budget Constrained Minimum Cost Connected Medians - Konjevod, Krumke, Marathe (Correct)
0.6: Cv - Konjevod (Correct)
0.6: A Branch-and-Cut Algorithm for the Undirected.. - Laporte.. (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/article/konjevod00budget.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
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
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
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
9 Approximation algorithms for the traveling purchaser problem.. - Ravi, Salman - 1999
7 Service constrained network design problems - Marathe, Ravi et al. - 1996
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 Network Design: Connectivity and Facilities Location (context) - for, network et al. - 1998
Documents on the same site (http://www.zib.de/paperweb/paperweb?year=2000&pubtype=1): More
Computer-aided design of novel siderophores.. - Meyer, Schnurre.. (2000) (Correct)
The Online-TSP Against Fair Adversaries - Blom, Krumke, De Paepe, Stougie (2000) (Correct)
Affine Invariant Convergence Analysis for Inexact Augmented.. - Volkwein, WEISER (2000) (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