840 search results - page 64 / 168 » Inapproximability of Combinatorial Optimization Problems |
127
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
110
click to vote
HEURISTICS
2002
15 years 5 days ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
80
Voted
TVLSI
2008
15 years 8 days ago
2008
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
117
click to vote
SIAMJO
2010
14 years 10 months ago
2010
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...