2137 search results - page 91 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
115
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
140
click to vote
IEICET
2010
14 years 11 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...
154
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
123
click to vote
ESA
2005
Springer
15 years 7 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...
123
click to vote
CIVR
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...