83 search results - page 6 / 17 » An Improved Exact Algorithm for Cubic Graph TSP |
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
DAC
2004
ACM
14 years 28 days ago
2004
ACM
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...
IPL
2002
13 years 7 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...