24 search results - page 1 / 5 » cocoa 2008 |
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
COCOA
2008
Springer
13 years 5 months ago
2008
Springer
We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we ex...
COCOA
2008
Springer
13 years 5 months ago
2008
Springer
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...