1090 search results - page 8 / 218 » Priority Algorithms for Graph Optimization Problems |
FSTTCS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
AUSSOIS
2001
Springer
14 years 14 hour ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
MM
2004
ACM
14 years 28 days ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 7 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
4OR
2004
13 years 7 months ago
2004
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...