7150 search results - page 223 / 1430 » An Approximation Algorithm for Approximation Rank |
139
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We describe a new approximation algorithm for Max Cut. Our algorithm runs in ~O(n2 ) time, where n is the number
162
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
161
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
160
click to vote
DISOPT
2010
15 years 6 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
190
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...