Sciweavers

7129 search results - page 176 / 1426
» Approximation Algorithms for Treewidth
Sort
View
125
Voted
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
15 years 9 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
122
Voted
STOC
2005
ACM
111views Algorithms» more  STOC 2005»
16 years 3 months ago
Tensor decomposition and approximation schemes for constraint satisfaction problems
Wenceslas Fernandez de la Vega, Marek Karpinski, R...
73
Voted
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
16 years 3 months ago
Asymmetric k-center is log* n-hard to approximate
Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjee...
84
Voted
STOC
2002
ACM
84views Algorithms» more  STOC 2002»
16 years 3 months ago
Random sampling and approximation of MAX-CSP problems
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...
105
Voted
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
16 years 3 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...