743 search results - page 36 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
152
Voted
IEICET
2010
15 years 1 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
133
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
119
click to vote
IPL
2002
15 years 3 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
144
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
141
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...