149 search results - page 20 / 30 » The Longest Path Problem Is Polynomial on Interval Graphs |
MOR
2010
13 years 5 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
ITC
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
MOBICOM
2003
ACM
14 years 19 days ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
SODA
1992
ACM
13 years 8 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...
VLDB
2004
ACM
14 years 22 days ago
2004
ACM
Different models have been proposed recently for representing temporal data, tracking historical information, and recovering the state of the document as of any given time, in XM...