354 search results - page 6 / 71 » Algorithms for the Minimum Edge Cover of H-Subgraphs of a Gr... |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
ACL
2006
13 years 8 months ago
2006
Given a parallel corpus, semantic projection attempts to transfer semantic role annotations from one language to another, typically by exploiting word alignments. In this paper, w...
WAOA
2004
Springer
14 years 22 days ago
2004
Springer
TCS
2010
13 years 5 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph