On the public citation graph
Approximation algorithms for finding low‐degree subgraphs
0 signed · 37 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/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1002/net.3230120402openalex-snapshot
Topological design of centralized computer networks—formulations and algorithms
inferredcites →https://doi.org/10.1006/jagm.1994.1042openalex-snapshot
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
inferredcites →https://doi.org/10.1007/978-3-540-24597-1_25openalex-snapshot
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01299747openalex-snapshot
A primal-dual approximation algorithm for generalized steiner network problems
inferredcites →https://doi.org/10.1007/bf01585864openalex-snapshot
An efficient approximation algorithm for the survivable network design problem
inferredcites →https://doi.org/10.1007/bf01788671openalex-snapshot
On a connection between the existence ofk-trees and the toughness of a graph
inferredcites →https://doi.org/10.1007/s00453-001-0038-2openalex-snapshot
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
inferredcites →https://doi.org/10.1016/0012-365x(73)90138-6openalex-snapshot
Tough graphs and hamiltonian circuits
inferredcites →https://doi.org/10.1016/0166-218x(90)90001-sopenalex-snapshot
Recognizing tough graphs is NP-hard
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.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1145/167088.167268openalex-snapshot
A primal-dual approximation algorithm for generalized Steiner network problems
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/978-3-030-61792-9_2openalex-snapshot
Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_4openalex-snapshot
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
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/978-3-642-13731-0_38openalex-snapshot
Improved Algorithm for Degree Bounded Survivable Network Design Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_25openalex-snapshot
Network-Design with Degree Constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.007openalex-snapshot
Edge ranking and searching in partial orders
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.105openalex-snapshot
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
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.jcss.2013.01.019openalex-snapshot
On some network design problems with degree constraints
inferred← citeshttps://doi.org/10.1016/j.jda.2011.05.001openalex-snapshot
Parameterized complexity of finding small degree-constrained subgraphs
inferred← citeshttps://doi.org/10.1109/icdcs.2015.66openalex-snapshot
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees
inferred← citeshttps://doi.org/10.1109/infocom.2008.223openalex-snapshot
Building Robust Nomadic Wireless Mesh Networks Using Directional Antennas
inferred← citeshttps://doi.org/10.1137/070700620openalex-snapshot
Survivable Network Design with Degree or Order Constraints
inferred← citeshttps://doi.org/10.1137/080734340openalex-snapshot
Additive Guarantees for Degree-Bounded Directed Network Design
inferred← citeshttps://doi.org/10.1137/110854461openalex-snapshot
Additive Approximation for Bounded Degree Survivable Network Design
inferred← citeshttps://doi.org/10.1145/1250790.1250886openalex-snapshot
Survivable network design with degree or order constraints
inferred← citeshttps://doi.org/10.1145/1374376.1374485openalex-snapshot
Additive approximation for bounded degree survivable network design
inferred← citeshttps://doi.org/10.1145/1374376.1374486openalex-snapshot
Additive guarantees for degree bounded directed network design
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94554openalex-snapshot
Optimization in graphs under degree constraints. application to telecommunication networks
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.