Element perturbation problems of optimum spanning trees with two-parameter objectives
From MaRDI portal
Publication:674298
DOI10.1016/0020-0190(94)00173-VzbMATH Open0875.68672OpenAlexW2081950775MaRDI QIDQ674298FDOQ674298
Authors: Yung-Cheng Chang, Lih-Hsing Hsu 
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00173-v
Recommendations
- On spanning tree problems with multiple objectives
- Publication:4733693
- Optimality computation of the minimum stretch spanning tree problem
- Optimality conditions in preference-based spanning tree problems
- On possibly optimal tradeoffs in multicriteria spanning tree problems
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- A GENERALIZED OPTIMUM REQUIREMENT SPANNING TREE PROBLEM WITH A MONGE-LIKE PROPERTY
- scientific article; zbMATH DE number 1788251
- The two-level diameter constrained spanning tree problem
- An explicit solution of a generalized optimum requirement spanning tree problem with a property related to Monge
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Graph theory
- Depth-First Search and Linear Graph Algorithms
- The k most vital arcs in the shortest path problem
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs
- An efficient algorithm for K shortest simple paths
- Maximizing Classes of Two-Parameter Objectives Over Matroids
- Matroid Applications and Algorithms
- The most vital edges of matching in a bipartite graph
- Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
This page was built for publication: Element perturbation problems of optimum spanning trees with two-parameter objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674298)
