3875 search results - page 318 / 775 » Approximation algorithms for the 0-extension problem |
183
click to vote
IPCO
2010
15 years 8 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
184
click to vote
GECCO
2007
Springer
16 years 29 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
177
click to vote
STRINGOLOGY
2004
15 years 8 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
171
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
195
click to vote
IJCV
2012
13 years 9 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...