Sciweavers

3019 search results - page 51 / 604
» Approximating the Domatic Number
Sort
View
RSEISP
2007
Springer
15 years 6 months ago
Rough Sets and Approximation Schemes
Abstract. Approximate reasoning is used in a variety of reasoning tasks in Logicbased Artificial Intelligence. In this abstract we compare a number of such reasoning schemes and s...
Victor W. Marek, Miroslaw Truszczynski
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
15 years 3 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
DMIN
2008
147views Data Mining» more  DMIN 2008»
15 years 1 months ago
Approximate Computation of Object Distances by Locality-Sensitive Hashing
We propose an approximate computation technique for inter-object distances for binary data sets. Our approach is based on the locality sensitive hashing, scales up with the number ...
Selim Mimaroglu, Dan A. Simovici
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 12 months ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
Satyen Kale, C. Seshadhri
CORR
2008
Springer
133views Education» more  CORR 2008»
14 years 12 months ago
A simple local 3-approximation algorithm for vertex cover
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
Valentin Polishchuk, Jukka Suomela