Sciweavers

1389 search results - page 26 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
SPAA
2003
ACM
15 years 4 months ago
Improved approximation algorithms for the freeze-tag problem
Esther M. Arkin, Michael A. Bender, Dongdong Ge
CORR
2008
Springer
44views Education» more  CORR 2008»
14 years 11 months ago
An Improved Approximation Algorithm for the Column Subset Selection Problem
Christos Boutsidis, Michael W. Mahoney, Petros Dri...
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
15 years 12 months ago
The importance of being biased
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
Irit Dinur, Shmuel Safra
STOC
2007
ACM
154views Algorithms» more  STOC 2007»
15 years 12 months ago
Improved approximation for directed cut problems
Amit Agarwal, Noga Alon, Moses Charikar