On the public citation graph
Survivable Network Design with Degree or Order Constraints
0 signed · 96 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/net.20005openalex-snapshot
Algorithms for a network design problem with crossing supermodular demands
inferredcites →https://doi.org/10.1002/net.20031openalex-snapshot
Approximation algorithms for finding low‐degree subgraphs
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.1006/jcss.1997.1542openalex-snapshot
A Constant-Factor Approximation Algorithm for thek-MST Problem
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/11830924_16openalex-snapshot
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
inferredcites →https://doi.org/10.1007/3-540-56287-7_112openalex-snapshot
Approximation through local optimality: Designing networks with small degree
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/bf01581256openalex-snapshot
A note on the prize collecting traveling salesman problem
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.1007/s004930170004openalex-snapshot
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/j.jcss.2005.05.006openalex-snapshot
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
inferredcites →https://doi.org/10.1109/focs.2006.48openalex-snapshot
Minimum Bounded Degree Spanning Trees
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/s0097539702416736openalex-snapshot
Hardness of Approximation for Vertex-Connectivity Network Design Problems
inferredcites →https://doi.org/10.1137/s0097539702418048openalex-snapshot
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s009753979528826xopenalex-snapshot
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
inferredcites →https://doi.org/10.1137/s0895480194266331openalex-snapshot
Spanning Trees—Short or Small
inferredcites →https://doi.org/10.1145/1250790.1250887openalex-snapshot
Approximating minimum bounded degree spanning trees to within one of optimal
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.5903openalex-snapshot
Energy‐efficient Link Scheduling in Time‐variant Dual‐Hop 60GHz Wireless Networks
inferred← citeshttps://doi.org/10.1002/jgt.22373openalex-snapshot
Highly edge‐connected factors using given lists on degrees
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_26openalex-snapshot
Bounded Degree Group Steiner Tree Problems
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-319-07557-0_31openalex-snapshot
A Unified Algorithm for Degree Bounded Survivable Network Design
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_1openalex-snapshot
Approximation Algorithms for k-Connected Graph Factors
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_8openalex-snapshot
On Temporally Connected Graphs of Small Cost
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_17openalex-snapshot
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_19openalex-snapshot
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
inferred← citeshttps://doi.org/10.1007/978-3-642-05434-1_6openalex-snapshot
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
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-22935-0_25openalex-snapshot
Network-Design with Degree Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_4openalex-snapshot
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_49openalex-snapshot
Degree-Constrained Node-Connectivity
inferred← citeshttps://doi.org/10.1007/s00224-016-9723-zopenalex-snapshot
Approximation Algorithms for Connected Graph Factors of Minimum Weight
inferred← citeshttps://doi.org/10.1007/s00224-017-9757-xopenalex-snapshot
The Complexity of Optimal Design of Temporally Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9701-zopenalex-snapshot
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation
inferred← citeshttps://doi.org/10.1007/s00453-013-9849-1openalex-snapshot
Degree Constrained Node-Connectivity Problems
inferred← citeshttps://doi.org/10.1007/s00453-021-00836-5openalex-snapshot
The Maximum Binary Tree Problem
inferred← citeshttps://doi.org/10.1007/s00453-022-00924-0openalex-snapshot
On Approximating Degree-Bounded Network Design Problems
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.1007/s10107-012-0544-9openalex-snapshot
A simple LP relaxation for the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s10107-015-0858-5openalex-snapshot
A unified algorithm for degree bounded survivable network design
inferred← citeshttps://doi.org/10.1007/s10107-025-02239-8openalex-snapshot
Fast Combinatorial Algorithms for Efficient Sortation
inferred← citeshttps://doi.org/10.1007/s10287-016-0260-7openalex-snapshot
On the minimum-cost $$\lambda $$ λ -edge-connected k-subgraph problem
inferred← citeshttps://doi.org/10.1007/s10878-014-9774-5openalex-snapshot
Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.003openalex-snapshot
The minimum degree Group Steiner problem
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.disopt.2016.05.006openalex-snapshot
Binary Steiner trees: Structural results and an exact solution approach
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.orl.2017.01.002openalex-snapshot
Approximating bounded-degree spanning trees and connected factors with leaves
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.001openalex-snapshot
Improved approximation algorithms for maximum lifetime problems in wireless networks
inferred← citeshttps://doi.org/10.1016/j.trb.2014.10.004openalex-snapshot
Regenerator Location Problem and survivable extensions: A hub covering location perspective
inferred← citeshttps://doi.org/10.1080/00207179.2022.2117084openalex-snapshot
Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems
inferred← citeshttps://doi.org/10.1109/cbd.2019.00069openalex-snapshot
Energy-Efficient Link Scheduling with Load Constraints in Dual-Hop 60GHz Wireless Networks
inferred← citeshttps://doi.org/10.1109/focs.2008.47openalex-snapshot
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
inferred← citeshttps://doi.org/10.1109/focs.2012.30openalex-snapshot
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
inferred← citeshttps://doi.org/10.1109/focs.2012.61openalex-snapshot
Everywhere-Sparse Spanners via Dense Subgraphs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00011openalex-snapshot
Thin Trees for Laminar Families
inferred← citeshttps://doi.org/10.1109/icdcs.2010.54openalex-snapshot
Parameterized Maximum and Average Degree Approximation in Topic-Based Publish-Subscribe Overlay Network Design
inferred← citeshttps://doi.org/10.1109/vtc2022-spring54318.2022.9860989openalex-snapshot
Linear TDOA-based Measurements for Distributed Estimation and Localized Tracking
inferred← citeshttps://doi.org/10.1137/080729918openalex-snapshot
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
inferred← citeshttps://doi.org/10.1137/110854461openalex-snapshot
Additive Approximation for Bounded Degree Survivable Network Design
inferred← citeshttps://doi.org/10.1137/120902847openalex-snapshot
Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
inferred← citeshttps://doi.org/10.1137/13094503xopenalex-snapshot
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
inferred← citeshttps://doi.org/10.1137/20m1330762openalex-snapshot
A Spectral Approach to Network Design
inferred← citeshttps://doi.org/10.1145/2591796.2591837openalex-snapshot
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
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/3522588openalex-snapshot
Network Design for s - t Effective Resistance
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25729openalex-snapshot
Truthful Mechanisms for Steiner Tree Problems
inferred← citeshttps://doi.org/10.2172/1055603openalex-snapshot
combinatorial optimization with demands (LDRD Final Report)
inferred← citeshttps://doi.org/10.3390/math12223521openalex-snapshot
Degree-Constrained Steiner Problem in Graphs with Capacity Constraints
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.30openalex-snapshot
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
inferred← citeshttps://doi.org/10.48550/arxiv.1203.3578openalex-snapshot
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0144openalex-snapshot
Everywhere-Sparse Spanners via Dense Subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1212.3981openalex-snapshot
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
inferred← citeshttps://doi.org/10.70675/0233ed2bzb00dz4dedzafb6z79c5c23a9be5openalex-snapshot
Scalable view-based techniques for web data : algorithms and systems
inferred← citeshttps://doi.org/10.7287/peerj-cs.538v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.538v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.538v0.1/reviews/3openalex-snapshot
Peer Review #3 of "Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.538v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.538v0.2/reviews/2openalex-snapshot
Peer Review #2 of "Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.538openalex-snapshot
Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree
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
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.