Sciweavers

316 search results - page 9 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
FOCS
2005
IEEE
14 years 1 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...
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 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
ECML
2004
Springer
14 years 26 days ago
Model Approximation for HEXQ Hierarchical Reinforcement Learning
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...
Bernhard Hengst
TALG
2010
123views more  TALG 2010»
13 years 5 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina
PODC
2009
ACM
14 years 8 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young