Sciweavers

7930 search results - page 257 / 1586
» Greedy in Approximation Algorithms
Sort
View
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
16 years 6 months ago
Asymmetric k-center is log* n-hard to approximate
Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjee...
STOC
2002
ACM
84views Algorithms» more  STOC 2002»
16 years 6 months ago
Random sampling and approximation of MAX-CSP problems
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
16 years 6 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 4 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 10 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
Given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...