841 search results - page 53 / 169 » Approximability of Minimum AND-Circuits |
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
FOCS
1996
IEEE
14 years 2 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
EOR
2008
13 years 10 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
IJSNET
2007
13 years 10 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...