574 search results - page 48 / 115 » Approximation Algorithms for Free-Label Maximization |
NETWORKS
2011
13 years 3 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
ISAAC
2001
Springer
14 years 1 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
ICRA
2008
IEEE
14 years 3 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
ISBI
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose a simple and straightforward analytic solution for the Q-ball reconstruction of the diffusion orientation distribution function (ODF) of the underlying fiber population...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...