On the public citation graph
Algorithms for a network design problem with crossing supermodular demands
0 signed · 50 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.1006/jagm.1999.1042openalex-snapshot
Approximation Algorithms for Directed Steiner Problems
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/bf02523690openalex-snapshot
A series of approximation algorithms for the acyclic directed steiner tree problem
inferredcites →https://doi.org/10.1007/s004930170004openalex-snapshot
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
inferredcites →https://doi.org/10.1109/sfcs.1998.743495openalex-snapshot
A factor 2 approximation algorithm for the generalized Steiner network problem
inferredcites →https://doi.org/10.1137/0210019openalex-snapshot
Approximation Algorithms for Several Graph Augmentation Problems
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.1145/174652.174654openalex-snapshot
Biconnectivity approximations and graph carvings
inferredcites →https://doi.org/10.1145/258533.258641openalex-snapshot
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
inferredcites →https://doi.org/10.1287/ijoc.1040.0066openalex-snapshot
Primal-Dual-Based Algorithms for a Directed Network Design 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.20289openalex-snapshot
Approximating the smallest k‐edge connected spanning subgraph by LP‐rounding
inferred← citeshttps://doi.org/10.1007/11496915_29openalex-snapshot
On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
inferred← citeshttps://doi.org/10.1007/978-1-4614-1701-9openalex-snapshot
Design and Analysis of Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_20openalex-snapshot
Problémes de conception de réseaux
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_10openalex-snapshot
Approximation Algorithms for Multi-budgeted Network Design Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_20openalex-snapshot
Netzwerk-Design-Probleme
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-13731-0_38openalex-snapshot
Improved Algorithm for Degree Bounded Survivable Network Design Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_20openalex-snapshot
Netzwerk-Design-Probleme
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_51openalex-snapshot
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_20openalex-snapshot
Netzwerk-Design-Probleme
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_20openalex-snapshot
Problemi di progettazione di reti
inferred← citeshttps://doi.org/10.1007/s00236-024-00475-7openalex-snapshot
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
inferred← citeshttps://doi.org/10.1007/s10107-006-0061-9openalex-snapshot
On the L∞-norm of extreme points for crossing supermodular directed network LPs
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.11.009openalex-snapshot
The k -path tree matroid and its applications to survivable network design
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.10.002openalex-snapshot
LP-based solution methods for the asymmetric TSP
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.001openalex-snapshot
The multi-budgeted and weighted bounded degree metric Steiner network 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.2010.11.043openalex-snapshot
Approximating directed weighted-degree constrained networks
inferred← citeshttps://doi.org/10.1017/cbo9780511977152openalex-snapshot
Iterative Methods in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1109/icimp.2009.17openalex-snapshot
Extraction of Parameters from Well Managed Networked System in Access Control
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.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.1374486openalex-snapshot
Additive guarantees for degree bounded directed network design
inferred← citeshttps://doi.org/10.1145/3055399.3055445openalex-snapshot
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
inferred← citeshttps://doi.org/10.1201/9781420010749.ch58openalex-snapshot
Approximating Minimum-Cost Connectivity Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01644openalex-snapshot
Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree
inferred← citeshttps://doi.org/10.5555/1070432.1070511openalex-snapshot
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
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.