Sciweavers

7015 search results - page 157 / 1403
» Approximation algorithms for co-clustering
Sort
View
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
14 years 29 days ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 3 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
STOC
2005
ACM
111views Algorithms» more  STOC 2005»
14 years 10 months ago
Tensor decomposition and approximation schemes for constraint satisfaction problems
Wenceslas Fernandez de la Vega, Marek Karpinski, R...
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 10 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»
14 years 10 months ago
Random sampling and approximation of MAX-CSP problems
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...