See this document in CiteSeerX!

Postman Problems on Mixed Graphs (2003)  (Make Corrections)  
Francisco Javier Zaragoza Mart



  Home/Search   Context   Related

 
View or download:
etd.uwaterloo.ca/e...zamartinez2003.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  etd.uwaterloo.ca/etd/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 well-known linear programming relaxations of this problem are equivalent. The extra cost of a mixed postman tour T is the cost of T minus the cost of the edges and arcs of M . We prove that it is to approximate the minimum extra cost of a mixed postman tour. (Update)

Active bibliography (related documents):   More   All
3.0:   A 3/2-approximation algorithm for the Windy Postman Problem - Raghavachari, Veerasamy (2001)   (Correct)
2.2:   Approximation Algorithms for Mixed Postman Problem - Raghavachari, Veerasamy (1998)   (Correct)
1.2:   Taking a Walk on a Graph - Maruyama, Miyano   (Correct)

Similar documents based on text:   More   All
0.2:   The Minimum Cycle Cover and the Chinese Postman.. - Fernandes, Lee.. (1990)   (Correct)
0.2:   A Note On k Best Solutions To The Chinese Postman Problem - Saruwatari, Matsui (1993)   (Correct)
0.1:   Graph Learning with a Nearest Neighbor Approach - Koenig, Smirnov (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ mart-postman,
  author = "Francisco Javier Zaragoza Mart",
  title = "Postman Problems on Mixed Graphs",
  url = "citeseer.ist.psu.edu/zaragozamart03postman.html" }
Citations (may not include all citations):
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
951   Computational Complexity (context) - Papadimitriou - 1994
773   Reducibility among combinatorial problems (context) - Karp - 1972
686   A Guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
534   The complexity of theorem-proving procedures (context) - Cook - 1971
459   A computing procedure for quantification theory (context) - Davis, Putnam - 1960
448   A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984
354   A note on two problems in connexion with graphs (context) - Dijkstra - 1959
318   Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
303   Princeton University Press (context) - Ford, Fulkerson et al. - 1962
219   and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
129   A polynomial algorithm in linear programming (context) - Khachiyan - 1979
127   The complexity of satisfiability problems (context) - Schaefer - 1978
117   The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Lovasz et al. - 1981
102   A characterization of the minimum cycle mean in a digraph (context) - Karp - 1978
91   Approximation Algorithms (context) - Vazirani - 2001
86   A theorem on boolean matrices (context) - Warshall - 1962
66   Decomposition of regular matroids (context) - Seymour - 1980
61   Planar formulae and their uses (context) - Lichtenstein - 1982
56   Maximum matching and a polyhedron with (context) - Edmonds - 1965
55   American Elsevier Publishing Co (context) - Bondy, Murty et al. - 1976
52   Sur le probleme des courbes gauches en topologie (context) - Kuratowski - 1930
49   Algorithm 97: Shortest path (context) - Floyd - 1962
48   Odd minimum cut-sets and b-matchings (context) - Padberg, Rao - 1982
47   Zur allgemeinen Kurventheorie (context) - Menger - 1927
41   the computational complexity of Ising spin glass models (context) - Barahona - 1982
36   Finding a maximum cut of a planar graph in polynomial time (context) - Hadlock - 1975
33   Kluwer Academic Publishers (context) - Dror, Routing et al. - 2000
28   Euler tours and the Chinese postman (context) - Edmonds, Johnson - 1973
27   Theoretical improvements in algorithmic e#ciency for network.. (context) - Edmonds, Karp - 1972
24   A theorem on flows in networks (context) - Gale - 1957
22   and flowers (context) - Edmonds, trees - 1965
21   Solving linear programming problems in integers (context) - Gomory - 1960
21   The max-cut problem on graphs not contractible to K (context) - Barahona - 1983
20   Uber eine Eigenschaft der ebenen Komplexe (context) - Wagner - 1937
20   Edmonds polytopes and a hierarchy of combinatorial problems (context) - Chvatal - 1973
20   Matching: A well-solved class of integer linear programs (context) - Edmonds, Johnson - 1969
19   Combinatorial Optimization Problems and their Approximabilit.. (context) - Ausiello, Crescenzi et al. - 1999
19   Theorie der endlichen und unendlichen Graphen (context) - Konig - 1936
15   Maximization of a linear function of variables subject to li.. (context) - Dantzig - 1951
14   PORTA -- POlyhedron Representation Transformation Algorithm (context) - Christof, Lobel - 2002
12   Wiley-Interscience Series in Discrete Mathematics and Optimi.. (context) - Cook, Cunningham et al. - 1998
12   volume 24 of Algorithms and Combinatorics (context) - Schrijver, Polyhedra et al. - 2003
11   the complexity of edge traversing (context) - Papadimitriou - 1976
9   Approximation algorithms for some postman problems (context) - Frederickson - 1979
8   On cuts and matchings in planar graphs (context) - Barahona - 1993
7   Graphic programming using odd or even points (context) - Guan - 1960
7   Graph Theory (context) - Biggs, Lloyd et al. - 1936
6   einen Linienzug ohne Wiederholung und ohne Unterbrechung zu .. (context) - Hierholzer, Moglichkeit
6   the complexity of bicoloring clique hypergraphs of graphs (context) - Kratochvl, Tuza - 2002
5   Arc routing methods and applications (context) - Assad, Golden - 1995
5   Planar 3DM is NP-complete (context) - Dyer, Frieze - 1986
5   Topology of series-parallel networks (context) - Du - 1965
5   Some recent applications of the theory of linear inequalitie.. (context) - Ho - 1960
4   approximation algorithm for the mixed postman problem - Raghavachari, Veerasamy - 1999
3   An optimal algorithm for the mixed Chinese postman problem (context) - Nobert, Picard - 1996
3   the mixed Chinese postman problem - Ralphs - 1993
3   Contributions to Routing Problems (context) - Win - 1987
3   Algorithms for the windy postman problem (context) - Pearn, Li - 1994
2   Approximation algorithms for the asymmetric postman problem (context) - Raghavachari, Veerasamy - 1999
2   An optimal method for the mixed postman problem (context) - Christofides, Benavent et al. - 1983
2   On some applications of the Chinese postman problem (context) - Barahona - 1988
2   The mixed postman problem (context) - Kappauf, Koehler - 1979
2   Finding postal carrier walk paths in mixed graphs (context) - Yan, Thompson - 1998
2   the windy postman problem on Eulerian graphs (context) - Win - 1989
2   The Chinese postman problem for mixed networks (context) - Minieka - 1979
2   the windy postman problem (context) - Guan - 1984
2   A cutting plane algorithm for the windy postman problem (context) - Grotschel, Win - 1992
2   Solutio problematis ad geometrian situs pertinentis (context) - Euler
1   Zur Losung des Brieftragerproblems auf gemischten Graphen (context) - Jeworrek, Schulz - 1987
1   The Chinese postman problem for mixed graphs (context) - Brucker - 1980
1   Insights into a mixed Chinese postman problem (context) - Wang - 1995
1   A GRASP heuristic for the mixed Chinese postman problem (context) - Corberan, Mart et al. - 2002
1   Approximation Algorithms for Postman Problems (context) - Veerasamy - 1999
1   Circuits and Systems (context) - Barahona, minimization - 1990
1   An application of modular equations in analysis situs (context) - Veblen - 1912
1   A survey on the Chinese postman problem (context) - Guan - 1984
1   A heuristic algorithm for the mixed Chinese postman problem (context) - Yaoyuenyong, Charnsethikul et al. - 2002
1   Complexity of a restricted Chinese postman problem (context) - Tohyama, Adachi - 1996
1   Approximation algorithms for some postman problems over mixe.. (context) - Peng - 1989
1   Improved solutions for the Chinese postman problem on mixed .. (context) - Pearn, Chou - 1999
1   The Chinese's postman problem (context) - Edmonds - 1965
1   The Chinese postman problem (context) - Eiselt, Gendreau et al. - 1995
1   The rural postman problem (context) - Eiselt, Gendreau et al. - 1995
1   The complexity of two problems on windy graphs (context) - Du, Sun - 1997
1   The minimum cycle cover and the Chinese postman problems on .. - Fernandes, Lee et al. - 1990
1   Solving mixed and capacitated problems of the Chinese postma.. (context) - Greistorfer - 1995
1   Katholieke Universiteit Brabant (context) - Gerards, Polyhedra et al. - 1988
1   and conservative weightings (context) - Frank, on et al. - 1993
www.informatik.uni-heidelberg.de/

Documents on the same site (http://etd.uwaterloo.ca/etd/):   More
Multi-Resolution Approximate Inverses - Bridson (1999)   (Correct)
Efficient Simulation of Message-Passing in Distributed-Memory.. - Demaine (1996)   (Correct)
Occurrent Contractarianism: A Preference-Based Ethical Theory - Murray (1994)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC