840 search results - page 23 / 168 » Inapproximability of Combinatorial Optimization Problems |
CEC
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
IWANN
2005
Springer
14 years 4 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
ISCAS
2005
IEEE
14 years 4 months ago
2005
IEEE
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
STOC
2002
ACM
14 years 11 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...