183 search results - page 14 / 37 » On the Matching Problem for Special Graph Classes |
124
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
114
click to vote
MFCS
2007
Springer
15 years 7 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
83
Voted
DISOPT
2008
15 years 1 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...