667 search results - page 22 / 134 » Approximation algorithms for connected facility location pro... |
202
click to vote
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
139
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
155
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
119
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
142
click to vote
ANOR
2010
15 years 5 months ago
2010
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...