Results 1  10
of
620,268
A NearOptimal SublinearTime Algorithm for Approximating the Minimum Vertex Cover Size
, 2011
"... We give a nearly optimal sublineartime algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the ith neighbor of v. Letting VCopt(G) denote the minimum size of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We give a nearly optimal sublineartime algorithm for approximating the size of a minimum vertex cover in a graph G. The algorithm may query the degree deg(v) of any vertex v of its choice, and for each 1 ≤ i ≤ deg(v), it may ask for the ith neighbor of v. Letting VCopt(G) denote the minimum size
Sublineartime algorithms
 In Oded Goldreich, editor, Property Testing, volume 6390 of Lecture Notes in Computer Science
, 2010
"... In this paper we survey recent (up to end of 2009) advances in the area of sublineartime algorithms. 1 ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
In this paper we survey recent (up to end of 2009) advances in the area of sublineartime algorithms. 1
A SublinearTime Approximation Scheme for Bin Packing
, 2008
"... The bin packing problem is defined as follows: given a set of n items with sizes 0 < w1, w2,...,wn ≤ 1, find a packing of these items into minimum number of unitsize bins possible. We present a sublineartime asymptotic approximation scheme for the bin packing problem; that is, for any ɛ> 0, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The bin packing problem is defined as follows: given a set of n items with sizes 0 < w1, w2,...,wn ≤ 1, find a packing of these items into minimum number of unitsize bins possible. We present a sublineartime asymptotic approximation scheme for the bin packing problem; that is, for any ɛ> 0
SublinearTime Approximation of Euclidean Minimum Spanning Tree
, 2003
"... We consider the problem of estimating the weight of a Euclidean minimum spanning tree for a set of n points in R . We focus on the situation when the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a s ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
structured way. Our main result is that if we assume the access to the input is supported by a minimal bounding cube of the input, by orthogonal range queries, and by cone approximate nearest neighbors queries, then it is possible to estimate the weight of a Euclidean minimum spanning tree of P to within
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
hard. We prove that (1 \Gamma o(1)) ln n is a threshold below which set cover cannot be approximated efficiently, unless NP has slightly superpolynomial time algorithms. This closes the gap (up to low order terms) between the ratio of approximation achievable by the greedy algorithm (which is (1 \Gamma
SublinearTime Algorithms for Tournament Graphs
"... Abstract. We show that a random walk on a tournament on n vertices finds either a sink or a 3cycle in expected time O n · log n · log ∗ n that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic alg ..."
Abstract
 Add to MetaCart
Abstract. We show that a random walk on a tournament on n vertices finds either a sink or a 3cycle in expected time O n · log n · log ∗ n that is, sublinear both in the size of the description of the graph as well as in the number of vertices. This result is motivated by the search of a generic
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case
Results 1  10
of
620,268