Sciweavers

2421 search results - page 19 / 485
» Approximate Flow-Aware Networking
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 6 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
NETWORKS
2010
14 years 8 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan