Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

WG
2000
Springer

favoriteEmaildiscussreport

104views Theoretical Computer Science» more WG 2000»

Budget Constrained Minimum Cost Connected Medians

13 years 8 months ago

Budget Constrained Minimum Cost Connected Medians

Download optimierung.mathematik.uni-kl.de

Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems that aim 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

Goran Konjevod, Sven Oliver Krumke, Madhav V. Mara

Real-time Traffic

Dist ´Ú | Network Design | Service Distance | Theoretical Computer Science | WG 2000 |

claim paper

Related Content

» Budgeted RedBlue Median and Its Generalizations

» Bounded Budget Connection BBC Games or How to make friends and influence people on a budge...

» Constant factor approximation algorithm for the knapsack median problem

» A Weighted Coding in a Genetic Algorithm for the DegreeConstrained Minimum Spanning Tree P...

» Approximating Directed WeightedDegree Constrained Networks

» Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wi...

» Sensor Networks with Random Links Topology Design for Distributed Consensus

» A General Approximation Technique for Constrained Forest Problems

» Simultaneous shortpath and longpath timing optimization for FPGAs

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	2000
Where	WG
Authors	Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe

Comments (0)