7129 search results - page 276 / 1426 » Approximation Algorithms for Treewidth |
135
click to vote
COMPGEOM
2004
ACM
15 years 10 months 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 ...
113
click to vote
SODA
2010
ACM
16 years 1 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...
146
click to vote
SODA
2010
ACM
16 years 1 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...
157
click to vote
PAKDD
2009
ACM
16 years 1 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-...
138
click to vote
IPSN
2009
Springer
15 years 11 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...