840 search results - page 141 / 168 » Inapproximability of Combinatorial Optimization Problems |
TCBB
2011
13 years 5 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
CPAIOR
2011
Springer
13 years 2 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
FOGA
2011
13 years 2 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
HM
2007
Springer
14 years 5 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...