Sciweavers

7015 search results - page 94 / 1403
» Approximation algorithms for co-clustering
Sort
View
WABI
2005
Springer
15 years 10 months ago
A 1.375-Approximation Algorithm for Sorting by Transpositions
Isaac Elias, Tzvika Hartman
WAOA
2005
Springer
127views Algorithms» more  WAOA 2005»
15 years 10 months ago
Improved Approximation Algorithm for Convex Recoloring of Trees
Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz
ESA
2004
Springer
87views Algorithms» more  ESA 2004»
15 years 9 months ago
A Fast Distributed Algorithm for Approximating the Maximum Matching
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 8 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson