On the public citation graph

Additive Guarantees for Degree-Bounded Directed Network Design

0 signed · 71 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.1002/jgt.10092openalex-snapshot
Small degree out‐branchings
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.1007/3-540-48777-8_26openalex-snapshot
Approximation Algorithms for a Directed Network Design Problem
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_5openalex-snapshot
On the Crossing Spanning Tree Problem
inferredcites →https://doi.org/10.1007/978-3-540-68891-4_18openalex-snapshot
Degree Bounded Matroids and Submodular Flows
inferredcites →https://doi.org/10.1007/bf01681329openalex-snapshot
Matroid intersection algorithms
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/s10107-006-0061-9openalex-snapshot
On the L∞-norm of extreme points for crossing supermodular directed network LPs
inferredcites →https://doi.org/10.1007/s101070050040openalex-snapshot
Increasing the rooted-connectivity of a digraph by one
inferredcites →https://doi.org/10.1016/s0167-5060(08)70817-3openalex-snapshot
Matroid Intersection
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.1145/1374376.1374485openalex-snapshot
Additive approximation for bounded degree survivable network design
inferredcites →https://doi.org/10.1145/167088.167209openalex-snapshot
Many birds with one stone

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-1-4020-9688-4openalex-snapshot
Fundamental Problems in Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_23openalex-snapshot
Approximate Multi-matroid Intersection via Iterative Refinement
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-031-38906-1_37openalex-snapshot
Colored Constrained Spanning Tree on Directed Graphs
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-33461-5_10openalex-snapshot
k-Trails: Recognition, Complexity, and Approximations
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_4openalex-snapshot
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_18openalex-snapshot
Degree Bounded Matroids and Submodular Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-85209-4_34openalex-snapshot
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_18openalex-snapshot
Approximating Directed Weighted-Degree Constrained Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_9openalex-snapshot
Iterative Rounding for Multi-Objective Optimization Problems
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-29344-3_49openalex-snapshot
Degree-Constrained Node-Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_31openalex-snapshot
Constrained Matching Problems in Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_28openalex-snapshot
Chain-Constrained Spanning Trees
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/s00493-012-2760-6openalex-snapshot
Degree bounded matroids and submodular flows
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-015-0858-5openalex-snapshot
A unified algorithm for degree bounded survivable network design
inferred← citeshttps://doi.org/10.1007/s10107-017-1113-zopenalex-snapshot
k-Trails: recognition, complexity, and approximations
inferred← citeshttps://doi.org/10.1007/s10107-017-1126-7openalex-snapshot
Chain-constrained spanning trees
inferred← citeshttps://doi.org/10.1007/s10107-017-1150-7openalex-snapshot
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems
inferred← citeshttps://doi.org/10.1007/s10107-020-01524-yopenalex-snapshot
Approximate multi-matroid intersection via iterative refinement
inferred← citeshttps://doi.org/10.1007/s10107-025-02239-8openalex-snapshot
Fast Combinatorial Algorithms for Efficient Sortation
inferred← citeshttps://doi.org/10.1007/s11276-010-0287-6openalex-snapshot
Novel algorithms for the network lifetime problem in wireless settings
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.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.2010.02.005openalex-snapshot
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
inferred← citeshttps://doi.org/10.1016/j.orl.2016.09.014openalex-snapshot
Refuting a conjecture of Goemans on bounded degree spanning trees
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.2011.08.001openalex-snapshot
Improved approximation algorithms for maximum lifetime problems in wireless networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.027openalex-snapshot
Bi-criteria and approximation algorithms for restricted matchings
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
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/iscas.2009.5118080openalex-snapshot
Performance study of peer-to-peer video streaming on complex networks
inferred← citeshttps://doi.org/10.1137/1.9781611973099.120openalex-snapshot
Matroidal Degree-Bounded Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch13openalex-snapshot
Online Degree-Bounded Steiner Network Design
inferred← citeshttps://doi.org/10.1137/13094503xopenalex-snapshot
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
inferred← citeshttps://doi.org/10.1145/3313276.3316322openalex-snapshot
Approximation algorithms for minimum norm and ordered optimization problems
inferred← citeshttps://doi.org/10.1287/moor.2023.0012openalex-snapshot
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond
inferred← citeshttps://doi.org/10.14778/2732240.2732241openalex-snapshot
Delta
inferred← citeshttps://doi.org/10.15480/882.4143openalex-snapshot
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP
inferred← citeshttps://doi.org/10.3929/ethz-b-000128414openalex-snapshot
k-Trails: Recognition, Complexity, and Approximations
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.1605.03203openalex-snapshot
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2011.03194openalex-snapshot
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
inferred← citeshttps://doi.org/10.5555/2884435.2884448openalex-snapshot
Online degree-bounded steiner network design
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.