840 search results - page 35 / 168 » Inapproximability of Combinatorial Optimization Problems |
CORR
2011
Springer
13 years 6 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
EVOW
2004
Springer
14 years 4 months ago
2004
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
JEA
2008
13 years 11 months ago
2008
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
IWINAC
2007
Springer
14 years 5 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
ANOR
2005
13 years 11 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...