3875 search results - page 17 / 775 » Approximation algorithms for the 0-extension problem |
107
click to vote
OL
2010
14 years 4 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
IPL
2011
14 years 4 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
100
click to vote
CIARP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
119
click to vote
SMC
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...