Spanning trees and shortest paths in Monge graphs
type: Item
instance of: scholarly article
title: Spanning trees and shortest paths in Monge graphs
zbMATH Open document ID: 1088.90539
DOI: 10.1007/BF02684360
published in: Computing
publication date: 1998-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1130634
author: Tibor Dudás
author: Rüdiger Rudolf
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
cites work: Geometric applications of a matrix-searching algorithm
cites work: Special cases of travelling salesman problems and heuristics
cites work: Perspectives of Monge properties in optimization
cites work: A note on two problems in connexion with graphs
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: Balancing minimum spanning trees and shortest-path trees
cites work: A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
cites work: Monge matrices make maximization manageable
cites work: Extreme Hamiltonian lines
cites work: The concave least-weight subsequence problem revisited
full work available at URL: https://doi.org/10.1007/bf02684360
OpenAlex ID: W2003060598
description: scientific article; zbMATH DE number 1130634