3875 search results - page 59 / 775 » Approximation algorithms for the 0-extension problem |
IPL
2008
14 years 9 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
TAMC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
EOR
2008
14 years 9 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
109
click to vote
MST
2010
14 years 4 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
ALGORITHMICA
1999
14 years 9 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...