A greedy algorithm for finding maximum spanning trees in infinite graphs
From MaRDI portal
Publication:2102829
DOI10.1016/j.orl.2022.10.004OpenAlexW4305072505MaRDI QIDQ2102829
Christopher Thomas Ryan, Robert L. Smith
Publication date: 12 December 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2022.10.004
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Max-Flow Min-Cut theorem for countable networks
- Asymptotics for Euclidean minimal spanning trees on random points
- The scaling limit of the minimum spanning tree of the complete graph
- Topological paths, cycles and spanning trees in infinite graphs
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Graph topologies induced by edge lengths
- Conditions for the discovery of solution horizons
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
- Note on Independence Functions
- Conditions for the Existence of Planning Horizons
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Concepts of Forecast and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems
- A continuous-time network simplex algorithm
- Minimum cost spanning tree games
- On the History of the Minimum Spanning Tree Problem
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Inverse optimization in minimum cost flow problems on countably infinite networks
- Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
This page was built for publication: A greedy algorithm for finding maximum spanning trees in infinite graphs
