6740 search results - page 264 / 1348 » An s -Hamiltonian Line Graph Problem |
169
click to vote
TIT
2008
15 years 7 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
225
click to vote
JCO
1998
15 years 6 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
229
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
165
click to vote
SAC
2009
ACM
16 years 2 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
214
click to vote
COCOA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...