On the public citation graph
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
0 signed · 41 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.1002/(sici)1097-0118(200003)33:3<125::aid-jgt1>3.0.co;2-xopenalex-snapshot
Toughness, trees, and walks
inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/11538462_3openalex-snapshot
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
inferredcites →https://doi.org/10.1007/11786986_16openalex-snapshot
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/s10107-006-0046-8openalex-snapshot
Traveling salesman path problems
inferredcites →https://doi.org/10.1137/s009753970036917xopenalex-snapshot
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11538462_3openalex-snapshot
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
inferred← citeshttps://doi.org/10.1007/11786986_18openalex-snapshot
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_31openalex-snapshot
Fast Combinatorial Algorithms for Efficient Sortation
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_19openalex-snapshot
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
inferred← citeshttps://doi.org/10.1007/978-3-540-72031-7_4openalex-snapshot
Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_19openalex-snapshot
Network Design with Weighted Degree Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_9openalex-snapshot
On Generalizations of Network Design Problems with Degree Bounds
inferred← citeshttps://doi.org/10.1007/s00453-007-9115-5openalex-snapshot
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
inferred← citeshttps://doi.org/10.1007/s10107-009-0307-4openalex-snapshot
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
inferred← citeshttps://doi.org/10.1007/s10107-012-0537-8openalex-snapshot
On generalizations of network design problems with degree bounds
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.039openalex-snapshot
Bounded-degree light approximate shortest-path trees in doubling metrics
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.05.004openalex-snapshot
Network design with weighted degree constraints
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.06.011openalex-snapshot
Spanning trees with minimum weighted degrees
inferred← citeshttps://doi.org/10.1016/j.orl.2007.02.001openalex-snapshot
An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.sorms.2010.06.001openalex-snapshot
Approximation algorithms for network design: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.029openalex-snapshot
A push–relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
inferred← citeshttps://doi.org/10.1017/cbo9780511977152openalex-snapshot
Iterative Methods in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1109/focs.2006.48openalex-snapshot
Minimum Bounded Degree Spanning Trees
inferred← citeshttps://doi.org/10.1137/070700620openalex-snapshot
Survivable Network Design with Degree or Order Constraints
inferred← citeshttps://doi.org/10.1145/1250790.1250886openalex-snapshot
Survivable network design with degree or order constraints
inferred← citeshttps://doi.org/10.1145/1250790.1250887openalex-snapshot
Approximating minimum bounded degree spanning trees to within one of optimal
inferred← citeshttps://doi.org/10.1145/1374376.1374485openalex-snapshot
Additive approximation for bounded degree survivable network design
inferred← citeshttps://doi.org/10.1145/2629366openalex-snapshot
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
inferred← citeshttps://doi.org/10.1145/3618260.3649715openalex-snapshot
Ghost Value Augmentation for k-Edge-Connectivity
inferred← citeshttps://doi.org/10.3390/a17100467openalex-snapshot
Degree-Constrained Minimum Spanning Hierarchies in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02844openalex-snapshot
Selecting optimal minimum spanning trees that share a topological correspondence with phylogenetic trees
inferred← citeshttps://doi.org/10.7155/jgaa.00447openalex-snapshot
Computing phylogenetic trees using topologically related minimum spanning trees
inferred← citeshttps://doi.org/10.7939/r3gb1xt6vopenalex-snapshot
Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph
inferred← citeshttps://doi.org/10.7939/r3s04hopenalex-snapshot
Minimum Degree Spanning Trees on Bipartite Permutation Graphs
showing the first 30 of 31 · page through all 31
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.