3875 search results - page 70 / 775 » Approximation algorithms for the 0-extension problem |
161
Voted
SECON
2010
IEEE
15 years 2 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
138
click to vote
JUCS
2007
15 years 4 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
125
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
121
click to vote
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
141
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...