Sciweavers

220 search results - page 22 / 44
» Primal-Dual Algorithms for Connected Facility Location Probl...
Sort
View
INFOCOM
1998
IEEE
15 years 4 months ago
Demand-based Radio Network Planning of Cellular Mobile Communication Systems
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
Kurt Tutschku
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
FOCS
2005
IEEE
15 years 5 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 5 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
WAOA
2004
Springer
107views Algorithms» more  WAOA 2004»
15 years 5 months ago
Order-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
Spyros Angelopoulos