284 search results - page 8 / 57 » Linear Time Algorithms for Generalized Edge Dominating Set P... |
SAC
2004
ACM
14 years 29 days ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
GD
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
MFCS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
DGCI
2009
Springer
13 years 10 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...