1647 search results - page 188 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
135
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
112
Voted
WINE
2010
Springer
15 years 15 days ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
96
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
124
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
137
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...