Sciweavers

841 search results - page 1 / 169
» Approximability of Minimum AND-Circuits
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 4 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
IPL
2011
112views more  IPL 2011»
12 years 11 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
FOCS
1996
IEEE
13 years 9 months ago
A 3-Approximation for the Minimum Tree Spanning k Vertices
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
Naveen Garg
DAGSTUHL
2006
13 years 6 months ago
Approximability of Minimum AND-Circuits
Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
Jan Arpe, Bodo Manthey
CCCG
2006
13 years 6 months ago
A Simple Streaming Algorithm for Minimum Enclosing Balls
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
Hamid Zarrabi-Zadeh, Timothy M. Chan