Sciweavers

Share
IPL
2011

Improved approximation algorithms for minimum AND-circuits problem via k-set cover

9 years 1 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 algorithms, APX-hardness and fixed parameter tractability of the problem. In this note, we show that algorithms via the k-set cover problem yield improved approximation ratios for the minimum AND-circuit problem with maximum degree three. In particular,
Hiroki Morizumi
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where IPL
Authors Hiroki Morizumi
Comments (0)
books