1090 search results - page 180 / 218 » Priority Algorithms for Graph Optimization Problems |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
ICCV
1999
IEEE
14 years 8 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...