752 search results - page 73 / 151 » Faster approximation algorithms for the minimum latency prob... |
209
click to vote
FSTTCS
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
233
Voted
SODA
2012
ACM
13 years 10 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
224
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
193
click to vote
FORMATS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
157
click to vote
COCOON
2006
Springer
15 years 11 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....