7930 search results - page 118 / 1586 » Greedy in Approximation Algorithms |
155
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
162
click to vote
ORL
2008
15 years 6 months ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
152
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
165
click to vote
WINE
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
129
click to vote
CPE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we pre...