3 search results - page 1 / 1 » Constraint Bipartite Vertex Cover: Simpler Exact Algorithms ... |
FAW
2008
Springer
14 years 23 days ago
2008
Springer
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 ...
MFCS
1999
Springer
14 years 3 months ago
1999
Springer
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...