840 search results - page 94 / 168 » Inapproximability of Combinatorial Optimization Problems |
136
click to vote
PDP
2011
IEEE
14 years 4 months ago
2011
IEEE
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...
116
click to vote
DGCI
2009
Springer
15 years 3 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
95
Voted
CORR
2002
Springer
15 years 8 days ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
129
click to vote
CONSTRAINTS
2011
14 years 4 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
105
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...