7129 search results - page 74 / 1426 » Approximation Algorithms for Treewidth |
109
Voted
IJCGA
2002
15 years 2 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
105
Voted
SIGECOM
2006
ACM
15 years 8 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
142
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
142
Voted
EWSN
2011
Springer
14 years 6 months ago
2011
Springer
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
111
Voted
DGCI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, ...