841 search results - page 41 / 169 » Approximability of Minimum AND-Circuits |
STOC
2000
ACM
14 years 1 months ago
2000
ACM
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
OL
2010
13 years 3 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
SIAMDM
2000
13 years 8 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...