7930 search results - page 660 / 1586 » Greedy in Approximation Algorithms |
217
Voted
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
136
click to vote
MOC
1998
15 years 7 months ago
1998
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
197
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
195
Voted
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
201
Voted
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...