1064 search results - page 116 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
168
click to vote
VLSM
2005
Springer
15 years 10 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
145
click to vote
DGCI
2009
Springer
15 years 7 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
134
click to vote
STRINGOLOGY
2004
15 years 5 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...
154
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
162
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...