1963 search results - page 102 / 393 » The Maximum Solution Problem on Graphs |
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves th...
151
click to vote
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
123
click to vote
DAM
2008
15 years 2 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
102
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
118
Voted
AAAI
2000
15 years 3 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...