3875 search results - page 259 / 775 » Approximation algorithms for the 0-extension problem |
176
click to vote
CCCG
2009
15 years 7 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
172
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
186
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
185
click to vote
ALENEX
2008
15 years 8 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
181
click to vote
CAD
2006
Springer
15 years 6 months ago
2006
Springer
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone sp...