3874 search results - page 220 / 775 » Approximation Algorithms for k-hurdle Problems |
156
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
143
click to vote
GLVLSI
2010
IEEE
15 years 4 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
171
click to vote
ESA
2011
Springer
14 years 3 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
140
click to vote
SODA
1992
ACM
15 years 5 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
150
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...