500 search results - page 36 / 100 » Approximation algorithms for maximum independent set of pseu... |
103
Voted
EOR
2008
15 years 1 months ago
2008
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
134
click to vote
ALGORITHMICA
2010
15 years 1 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
117
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
117
click to vote
ALGORITHMICA
2002
15 years 1 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
84
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...