7930 search results - page 381 / 1586 » Greedy in Approximation Algorithms |
174
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
161
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
140
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
191
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
206
click to vote
PAKDD
2009
ACM
16 years 4 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...