4843 search results - page 6 / 969 » The Shortcut Problem - Complexity and Approximation |
107
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
139
click to vote
WDAG
2009
Springer
15 years 8 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
IPL
2006
15 years 1 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
STOC
2007
ACM
16 years 2 months ago
2007
ACM
95
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...