Sciweavers

2862 search results - page 9 / 573
» Bicriteria Network Design Problems
Sort
View
TALG
2008
111views more  TALG 2008»
13 years 7 months ago
On the approximability of some network design problems
Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh ...
SODA
2000
ACM
78views Algorithms» more  SODA 2000»
13 years 8 months ago
Strengthening integrality gaps for capacitated network design and covering problems
Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cy...
EAAI
2006
92views more  EAAI 2006»
13 years 7 months ago
Solving terminal assignment problems with groups encoding: The wedding banquet problem
This paper presents an extension of the terminal assignment problem (TA) in the case that groups of terminals must be assigned together. We analyze this situation by means of an e...
Sancho Salcedo-Sanz, José Antonio Portilla-...
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
MP
2002
96views more  MP 2002»
13 years 7 months ago
On capacitated network design cut-set polyhedra
Abstract. This paper provides an analysis of capacitated network design cut
Alper Atamtürk