14 search results - page 1 / 3 » An Efficient Exact Algorithm for Constraint Bipartite Vertex... |
MFCS
1999
Springer
13 years 8 months ago
1999
Springer
FAW
2008
Springer
13 years 6 months 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 ...
APPROX
2006
Springer
13 years 8 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...
SIAMCOMP
2008
13 years 4 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...