3875 search results - page 254 / 775 » Approximation algorithms for the 0-extension problem |
204
click to vote
ESA
2008
Springer
15 years 8 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...
192
click to vote
GLVLSI
2010
IEEE
15 years 6 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...
180
click to vote
SODA
1992
ACM
15 years 7 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...
189
click to vote
SODA
2008
ACM
15 years 8 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...
185
click to vote
IJSNET
2007
15 years 6 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...