45 search results - page 1 / 9 » Improved approximation algorithms for minimum AND-circuits p... |
IPL
2011
12 years 11 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
FCT
2007
Springer
13 years 10 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
APPROX
2000
Springer
13 years 8 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph