On the public citation graph
The Held—Karp algorithm and degree-constrained minimum 1-trees
0 signed · 26 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.
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.
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-9_10openalex-snapshot
Finding Minimum Spanning Trees with a Fixed Number of Links at a Node
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.15807/jorsj.19.32openalex-snapshot
AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
inferredcites →https://doi.org/10.15807/jorsj.20.1openalex-snapshot
A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20166openalex-snapshot
Lower and upper bounds for the degree‐constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_6openalex-snapshot
Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/s11590-016-1078-5openalex-snapshot
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length
inferred← citeshttps://doi.org/10.1007/s12597-022-00575-3openalex-snapshot
Design of capacitated degree constrained min-sum arborescence
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90169-0openalex-snapshot
A Lagrangean approach to the degree-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.orl.2005.04.010openalex-snapshot
A note on relatives to the Held and Karp 1-tree problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00321-6openalex-snapshot
A multiperiod degree constrained minimal spanning tree problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00071-7openalex-snapshot
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs
inferred← citeshttps://doi.org/10.1023/a:1011977126230openalex-snapshot
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1109/icccs61882.2024.10603116openalex-snapshot
Approximation Algorithms for Constructing Spanning $K-\text{trees}$ Using Variable-Sized Materials
inferred← citeshttps://doi.org/10.1109/icppw.2002.1039757openalex-snapshot
Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique
inferred← citeshttps://doi.org/10.1109/ispan.1999.778937openalex-snapshot
A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains
inferred← citeshttps://doi.org/10.1109/milcom.2005.1606127openalex-snapshot
Topology formulation algorithms for wireless networks with reconfigurable directional links
inferred← citeshttps://doi.org/10.1109/ncccs.2012.6413014openalex-snapshot
Bees algorithm for degree-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferred← citeshttps://doi.org/10.19030/rbis.v14i3.493openalex-snapshot
A Lagrangean Heuristic For The Degree Constrained Minimal Spanning Tree Problem
inferred← citeshttps://doi.org/10.6688/jise.2008.24.2.11openalex-snapshot
Heuristic and Simulated Annealing Algorithms for Wireless ATM Backbone Network Design Problem
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.