Sciweavers

116 search results - page 20 / 24
» Solving network design problems via iterative aggregation
Sort
View
FOCS
2002
IEEE
15 years 4 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
CSCW
1998
ACM
15 years 3 months ago
Just Talk to Me: A Field Study of Expertise Location
Everyday, people in organizations must solve their problems to get their work accomplished. To do so, they often must find others with knowledge and information. Systems that assi...
David W. McDonald, Mark S. Ackerman
TSP
2012
13 years 6 months ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 2 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
107
Voted
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 6 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy