Constraint bipartite vertex cover: simpler exact algorithms and implementations

Constraint bipartite vertex cover: simpler exact algorithms and implementations

0.00 Avg rating0 Votes
Article ID: iaor2012915
Volume: 23
Issue: 3
Start Page Number: 331
End Page Number: 355
Publication Date: Apr 2012
Journal: Journal of Combinatorial Optimization
Authors: ,
Keywords: combinatorial optimization
Abstract:

Constraint bipartite vertex cover is a graph‐theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations. We also discuss possible generalizations and enhancements.

Reviews

Required fields are marked *. Your email address will not be published.