7930 search results - page 689 / 1586 » Greedy in Approximation Algorithms |
199
click to vote
ICALP
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
129
click to vote
EDBT
2009
ACM
16 years 2 days ago
2009
ACM
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
190
click to vote
EMO
2001
Springer
15 years 12 months ago
2001
Springer
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
180
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
207
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 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...