Results 1  10
of
450
Parameterized Directed kChinese Postman Problem and k ArcDisjoint Cycles Problem on Euler Digraphs
"... ar ..."
Postman Problems, Priorities and the Concept of Servicing
, 2002
"... Abstract: The Hierarchical Chinese Postman Problem (HCPP) is a Chinese Postman Problem, in which the arcs are partitioned into classes and a precedence relation orders the classes according to priority. The problem is solvable in polynomial time if the ordering relation is linear and each class is c ..."
Abstract
 Add to MetaCart
Abstract: The Hierarchical Chinese Postman Problem (HCPP) is a Chinese Postman Problem, in which the arcs are partitioned into classes and a precedence relation orders the classes according to priority. The problem is solvable in polynomial time if the ordering relation is linear and each class
Postman Problems on Mixed Graphs
, 2003
"... The mixed postman problem consists of finding a minimum cost tour of a mixed graph M = (V, E, A) traversing all its edges and arcs at least once. We prove that two wellknown linear programming relaxations of this problem are equivalent. The extra cost of a mixed postman tour T is the cost of T minu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The mixed postman problem consists of finding a minimum cost tour of a mixed graph M = (V, E, A) traversing all its edges and arcs at least once. We prove that two wellknown linear programming relaxations of this problem are equivalent. The extra cost of a mixed postman tour T is the cost
Approximation Algorithms for Mixed Postman Problem
 SIAM J. Discrete Math
, 1998
"... The mixed postman problem, a generalization of the Chinese postman problem, is that of finding a shortest tour that traverses each edge of a given mixed graph (a graph containing both undirected and directed edges) at least once. The problem is solvable in polynomial time either if the graph is undi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The mixed postman problem, a generalization of the Chinese postman problem, is that of finding a shortest tour that traverses each edge of a given mixed graph (a graph containing both undirected and directed edges) at least once. The problem is solvable in polynomial time either if the graph
A 3/2approximation algorithm for the Windy Postman Problem
, 2001
"... The windy postman problem is a generalization of the Chinese postman problem in which the edgetraversal costs are asymmetric. The problem is to compute a shortest tour that traverses every edge of a given graph at least once, and it is known to be NPhard. An approximation algorithm with a perfo ..."
Abstract
 Add to MetaCart
performance ratio of 3 2 for the windy postman problem is presented. Keywords: Windy postman problem, Asymmetric postman problem, Chinese postman problem, Combinatorial optimization, Approximation algorithms, Linear programming. 1
A New Integer Programming Formulation for the Chinese Postman Problem with Time Dependent Travel Times
"... Abstract—The Chinese Postman Problem (CPP) is one of the classical problems in graph theory and is applicable in a wide range of fields. With the rapid development of hybrid systems and model based testing, Chinese Postman Problem with Time Dependent Travel Times (CPPTDT) becomes more realistic than ..."
Abstract
 Add to MetaCart
Abstract—The Chinese Postman Problem (CPP) is one of the classical problems in graph theory and is applicable in a wide range of fields. With the rapid development of hybrid systems and model based testing, Chinese Postman Problem with Time Dependent Travel Times (CPPTDT) becomes more realistic
Application Of The Chinese Postman Probiem Mode1 And Its Application To The
"... licence allowing the ..."
Minimal Eulerian Circuit in a Labeled Digraph ⋆
"... Abstract. Let G =(V,A) be an Eulerian directed graph with an arclabeling. In this work we study the problem of finding an Eulerian circuit of lexicographically minimal label among all Eulerian circuits of the graph. We prove that this problem is NPhard by showing a reduction from the DirectedHami ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Let G =(V,A) be an Eulerian directed graph with an arclabeling. In this work we study the problem of finding an Eulerian circuit of lexicographically minimal label among all Eulerian circuits of the graph. We prove that this problem is NPhard by showing a reduction from the Directed
Results 1  10
of
450