Vladimir Deineko, Rüdiger Rudolf, Gerhard J. Woeginger  Home/Search
Context Related
| tugraz.ac.at/pub/papers/m...sfb5.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fmatbhp1.tugraz.ac.at/~rudo...sp (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Incomplete Monge matrices are a generalization of standard Monge matrices: the values of some entries are not specified and the Monge property only must hold for all specified entries. We derive several combinatorial properties of incomplete Monge matrices and prove that the problem of recognizing permuted incomplete Monge matrices is NP-complete. For the special case of permuted Supnick matrices , we derive a fast recognition algorithm and thereby identify a special case of the n-vertex... (Update)
Similar documents based on text: More All
1.4: The Travelling Salesman Problem on Permuted Monge Matrices - Burkard, Deineko, Woeginger (1995) (Correct)
1.3: On the TSP with a Relaxed General Distribution Matrix - Deineko (1998) (Correct)
1.3: The Cone of Monge Matrices: Extremal Rays and Applications - Rudolf, Woeginger (1994) (Correct)
BibTeX entry: (Update)
V.G. Deineko, R. Rudolf and G.J. W¨oginger, On the recognition of permuted Supnick and incomplete Monge matrices, Acta Informatica 33, 1996, 559--569. http://citeseer.ist.psu.edu/deineko94recognition.html More
@article{ deineko96recognition,
author = "Vladimir Deineko and R{\"u}diger Rudolf and Gerhard J. Woeginger",
title = "On the recognition of permuted {Supnick} and incomplete {Monge} matrices",
journal = "Acta Informatica",
volume = "33",
number = "6",
month = "????",
pages = "559--569",
year = "1996",
url = "citeseer.ist.psu.edu/deineko94recognition.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
193 The traveling salesman problem (context) - Lawler, Lenstra et al. - 1985
21 Well-solved special cases (context) - Gilmore, Lawler et al.
20 On simple linear programming problems (context) - Hoffman - 1961
15 the reconstruction of specially structured matrices (context) - Deineko, Filonenko - 1979
13 Extreme hamiltonian lines (context) - Supnick - 1957
11 vertex traveling salesman problem that can be solved in O (context) - Park, case et al. - 1991
10 M'emoires sur la th'eorie des d'eblais et des remblais (context) - Monge
8 Optimierung und Kontrolle (context) - Burkard, Klinz et al. - 1994
7 Special cases of travelling salesman problems and heuristics (context) - Burkard - 1990
4 Characterization and algorithms for greedily solvable transp.. (context) - Shamir, Dietrich - 1990
4 Discrete Applied Mathematics (context) - Rudolf, d-dimensional et al. - 1994
3 the recognition of permuted Bottleneck Monge matrices (context) - Klinz, Rudolf et al. - 1993
3 a class of polynomially solvable travelling salesman problem.. (context) - Michalski - 1987
1 A general approach to avoid forbidden 2\Theta2 submatrices (context) - Deineko, Rudolf et al. - 1994
[Article contains additional citations not shown here]
Documents on the same site (http://fmatbhp1.tu-graz.ac.at/~rudolf/sp.htm): More
On Monge Sequences in d-Dimensional Arrays - Rudolf (1993) (Correct)
Spanning Trees and Shortest Paths in Monge Graphs - Dudás, Rudolf (1996) (Correct)
Computational Investigations on 3-dimensional Axial.. - Burkard, Rudolf (1992) (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