Route inspection problem

Known as: Postman tour, T-join, CPP 
In graph theory, a branch of mathematics and computer science, the Chinese postman problem (CPP), postman tour or route inspection problem is to find… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We study transportation problems where robots have to deliver packages and can transfer the packages among each other… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Whole genome shotgun assembly is the process of taking many short sequenced segments (reads) and reconstructing the genome from… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A large number of circumstances are associated with reduced serum concentrations of transthyretin (TTR), or prealbumin. The most… (More)
  • table 1
Is this relevant?
2007
2007
The paper examines applications of combinatorial optimization in logistics and transport, and considers some mathematical… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
  • figure 3.3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
 
Is this relevant?
Highly Cited
1997
Highly Cited
1997
There are basically three approaches for carrying out fast block motion estimation: 1) fast search by a reduction of motion… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper describes a method for generating test sequences for checking the conformance of a protocol implementation to its… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Approxtmatton algorithms for several NP-complete edge-covermg routing problems are presented and analyzed m terms of the worst… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Several polynomial time approximation algorithms for some NP-complete routing problems are presented, and the worst-case ratios… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?