57 search results - page 8 / 12 » Combinatorial algorithms for the minimum interval cost flow ... |
JMLR
2006
13 years 7 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
BROADNETS
2007
IEEE
14 years 2 months ago
2007
IEEE
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...
CONSTRAINTS
2008
13 years 7 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...