83 search results - page 14 / 17 » An Improved Exact Algorithm for Cubic Graph TSP |
120
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
124
click to vote
FCT
1993
Springer
15 years 5 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
110
click to vote
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
104
click to vote
DISOPT
2008
15 years 1 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
137
click to vote
SODA
1992
ACM
15 years 2 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...