Sciweavers

Share
3 search results - page 1 / 1
» Constraint Bipartite Vertex Cover: Simpler Exact Algorithms ...
Sort
View
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
8 years 6 months ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
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 ...
Guoqiang Bai 0002, Henning Fernau
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
8 years 8 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
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...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
books