3192 search results - page 22 / 639 » The minimum latency problem |
163
click to vote
IICAI
2003
15 years 5 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
159
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
121
Voted
DAM
2008
15 years 3 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
112
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
153
Voted
COLOGNETWENTE
2010
15 years 10 days ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...