Search Sciweavers | Sciweavers

1021 search results - page 24 / 205

» Fast Approximate PCPs

click to vote

ESA
2004
Springer

87views Algorithms» more ESA 2004»

A Fast Distributed Algorithm for Approximating the Maximum Matching

14 years 1 months ago

Download math.la.asu.edu

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...

claim paper

Read More »

click to vote

ICCSA
2004
Springer

106views Applied Computing» more ICCSA 2004»

A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes

14 years 1 months ago

Download www.sm.luth.se

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

claim paper

Read More »

click to vote

JCDCG
2004
Springer

147views Discrete Geometry» more JCDCG 2004»

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation

14 years 1 months ago

Download i11www.iti.uni-karlsruhe.de

Marc Benkert, Alexander Wolff, Florian Widmann

claim paper

Read More »

click to vote

CIKM
2009
Springer

150views Information Technology» more CIKM 2009»

Fast centrality approximation in modular networks

14 years 11 days ago

Download www.dcs.bbk.ac.uk

Shu Yan Chan, Ian X. Y. Leung, Pietro Liò

claim paper

Read More »

click to vote

CPM
1999
Springer

105views Combinatorics» more CPM 1999»

Fast Multi-dimensional Approximate Pattern Matching

14 years 6 hour ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers