A greedy algorithm for finding maximum spanning trees in infinite graphs
type: Item
instance of: scholarly article
title: A greedy algorithm for finding maximum spanning trees in infinite graphs
author: Christopher Thomas Ryan
author: Robert L. Smith
published in: Operations Research Letters
publication date: 2022-12-12T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7631931
zbMATH Keywords: spanning trees
zbMATH Keywords: infinite graphs
zbMATH Keywords: infinite-dimensional optimization
MaRDI profile type: Publication
full work available at URL: j.orl.2022.10.004
OpenAlex ID: W4305072505
cites work: The scaling limit of the minimum spanning tree of the complete graph
cites work: The Max-Flow Min-Cut theorem for countable networks
cites work: Q3056948
cites work: Asymptotics for Euclidean minimal spanning trees on random points
cites work: A continuous-time network simplex algorithm
cites work: Conditions for the Existence of Planning Horizons
cites work: Conditions for the discovery of solution horizons
cites work: Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
cites work: Q5874307
cites work: Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
cites work: Worst-case analysis of a new heuristic for the travelling salesman problem
cites work: Q3577833
cites work: Topological paths, cycles and spanning trees in infinite graphs
cites work: Graph topologies induced by edge lengths
cites work: On the History of the Minimum Spanning Tree Problem
cites work: Minimum cost spanning tree games
cites work: Q4945538
cites work: Q5636903
cites work: Inverse optimization in minimum cost flow problems on countably infinite networks
cites work: Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
cites work: Note on Independence Functions
cites work: A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
cites work: A simplex algorithm for minimum-cost network-flow problems in infinite networks
DOI: 10.1016/J.ORL.2022.10.004
description: scientific article; zbMATH DE number 7631931