3874 search results - page 365 / 775 » Approximation Algorithms for k-hurdle Problems |
206
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
166
Voted
MP
2006
15 years 6 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
171
Voted
CORR
2011
Springer
15 years 19 days ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
158
Voted
SODA
2012
ACM
13 years 8 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...
152
Voted
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...