840 search results - page 77 / 168 » Inapproximability of Combinatorial Optimization Problems |
127
click to vote
ICALP
2009
Springer
16 years 22 days ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
105
Voted
COR
2006
15 years 14 days ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
113
Voted
COR
2010
15 years 16 days ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
108
click to vote
JCO
2007
15 years 10 days ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
94
Voted
EVOW
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...