On the public citation graph

Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory

https://doi.org/10.1007/bfb0120910
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-011-7557-9openalex-snapshot
Combinatorial Programming: Methods and Applications
inferredcites →https://doi.org/10.1007/978-94-011-7557-9_8openalex-snapshot
The Peripatetic Salesman and Some Related Unsolved Problems
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1007/bf01585505openalex-snapshot
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
inferredcites →https://doi.org/10.1007/bf01958043openalex-snapshot
On the sum of matroids
inferredcites →https://doi.org/10.1007/s43069-021-00101-zopenalex-snapshot
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/s0095-8956(73)80006-1openalex-snapshot
Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs
inferredcites →https://doi.org/10.1057/jors.1976.126openalex-snapshot
Combinatorial Programming: Methods and Applications
inferredcites →https://doi.org/10.1080/03155986.1974.11731583openalex-snapshot
Augmented Threaded Index Method For Network Optimization
inferredcites →https://doi.org/10.1109/tcs.1979.1084645openalex-snapshot
Investigating solvability and complexity of linear active networks by means of matroids
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.6028/jres.069b.004openalex-snapshot
Minimum partition of a matroid into independent subsets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.1114openalex-snapshot
Building cost effective lower layer VPNs: The ILEC/CLEC dilemma
inferred← citeshttps://doi.org/10.1002/net.21477openalex-snapshot
On building multiple spanning trees and VLAN assignment in metro ethernet networks
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_14openalex-snapshot
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
inferred← citeshttps://doi.org/10.1007/978-3-642-77254-2_34openalex-snapshot
Upper and Lower Bounds for the Symmetric 2-Peripatetic Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-981-16-0010-4_1openalex-snapshot
Restoring Survivable Spanning Tree: An Alternative Algorithm
inferred← citeshttps://doi.org/10.1007/s10878-018-0249-yopenalex-snapshot
Edge-disjoint spanning trees and the number of maximum state circles of a graph
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90033-dopenalex-snapshot
Sensitivity analysis for symmetric 2-peripatetic salesman problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00113-0openalex-snapshot
The partial sum criterion for Steiner trees in graphs and shortest paths
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80128-8openalex-snapshot
Chapter 11 Network reliability
inferred← citeshttps://doi.org/10.1080/02331939108843650openalex-snapshot
Lower bounds for symmetricK-peripatetic salesman problems
inferred← citeshttps://doi.org/10.1080/02331939208843770openalex-snapshot
Bounds for the symmetric 2-peripatetic salesman problem
inferred← citeshttps://doi.org/10.1080/02331939608844173openalex-snapshot
The edge-disjoing steiner problem in graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxw012openalex-snapshot
Note on Edge-Colored Graphs for Networks with Homogeneous Faults
inferred← citeshttps://doi.org/10.1109/tnet.2015.2438254openalex-snapshot
Tunable Survivable Spanning Trees
inferred← citeshttps://doi.org/10.1109/tnet.2024.3364173openalex-snapshot
Edge-Disjoint Tree Allocation for Multi-Tenant Cloud Security in Datacenter Topologies
inferred← citeshttps://doi.org/10.1145/1400863.1400877openalex-snapshot
Symmetric range assignment with disjoint MST constraints
inferred← citeshttps://doi.org/10.1145/2591971.2591997openalex-snapshot
Tunable survivable spanning trees
inferred← citeshttps://doi.org/10.1145/2637364.2591997openalex-snapshot
Tunable survivable spanning trees
inferred← citeshttps://doi.org/10.11606/d.45.1992.tde-20220712-114321openalex-snapshot
Algoritmos paralelos em grafos: listas, florestas e coleções de florestas
inferred← citeshttps://doi.org/10.1287/moor.10.4.701openalex-snapshot
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3683541/v1openalex-snapshot
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
inferred← citeshttps://doi.org/10.47749/t/unicamp.2000.262983openalex-snapshot
Problemas combinatorios de congestionamento
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.