3875 search results - page 29 / 775 » Approximation algorithms for the 0-extension problem |
COMGEO
2010
ACM
14 years 9 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
77
Voted
STOC
2003
ACM
15 years 10 months ago
2003
ACM
WG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...