Sciweavers

1021 search results - page 24 / 205
» Fast Approximate PCPs
Sort
View
71
Voted
ESA
2004
Springer
87views Algorithms» more  ESA 2004»
15 years 7 months ago
A Fast Distributed Algorithm for Approximating the Maximum Matching
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
103
Voted
ICCSA
2004
Springer
15 years 7 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
JCDCG
2004
Springer
15 years 7 months ago
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
Marc Benkert, Alexander Wolff, Florian Widmann
CIKM
2009
Springer
15 years 6 months ago
Fast centrality approximation in modular networks
Shu Yan Chan, Ian X. Y. Leung, Pietro Liò
94
Voted
CPM
1999
Springer
105views Combinatorics» more  CPM 1999»
15 years 6 months ago
Fast Multi-dimensional Approximate Pattern Matching
Gonzalo Navarro, Ricardo A. Baeza-Yates