On the public citation graph
Approximating Steiner Networks with Node-Weights
0 signed · 58 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/inco.1998.2754openalex-snapshot
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets
inferredcites →https://doi.org/10.1006/jagm.1995.1029openalex-snapshot
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
inferredcites →https://doi.org/10.1007/bf01299747openalex-snapshot
A primal-dual approximation algorithm for generalized steiner network problems
inferredcites →https://doi.org/10.1007/bf02523686openalex-snapshot
An approximation algorithm for minimum-cost vertex-connectivity problems
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-0057-5openalex-snapshot
Power optimization for connectivity problems
inferredcites →https://doi.org/10.1016/j.tcs.2009.01.036openalex-snapshot
Inapproximability of survivable networks
inferredcites →https://doi.org/10.1137/s0097539702416736openalex-snapshot
Hardness of Approximation for Vertex-Connectivity Network Design Problems
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/1644015.1644020openalex-snapshot
Approximating connectivity augmentation problems
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4496639openalex-extracted
An $O(\Sqrt{K})$-Approximation Algorithm for \\ Minimum Power K Edge Disjoint St-Paths
inferred← citeshttps://doi.org/10.1002/net.21466openalex-snapshot
Approximating survivable networks with minimum number of steiner points
inferred← citeshttps://doi.org/10.1002/net.21739openalex-snapshot
Hardness and approximation for network flow interdiction
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_20openalex-snapshot
On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_23openalex-snapshot
An $$O(\sqrt{k})$$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths
inferred← citeshttps://doi.org/10.1007/978-3-031-74580-5_12openalex-snapshot
A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths
inferred← citeshttps://doi.org/10.1007/978-3-032-09120-8_12openalex-snapshot
A Logarithmic Approximation Algorithm for the Activation Edge-Multicover Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_7openalex-snapshot
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_19openalex-snapshot
Covering Problems in Edge- and Node-Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_2openalex-snapshot
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_50openalex-snapshot
Survivable Network Activation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_18openalex-snapshot
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_9openalex-snapshot
Prize-Collecting Survivable Network Design in Node-Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_1openalex-snapshot
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
inferred← citeshttps://doi.org/10.1007/978-981-10-6147-9_3openalex-snapshot
Spider Covering Algorithms for Network Design Problems
inferred← citeshttps://doi.org/10.1007/s00453-014-9869-5openalex-snapshot
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
inferred← citeshttps://doi.org/10.1007/s10107-025-02298-xopenalex-snapshot
Approximation algorithms for network design in non-uniform fault models
inferred← citeshttps://doi.org/10.1007/s10878-014-9720-6openalex-snapshot
A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem
inferred← citeshttps://doi.org/10.1007/s10898-019-00804-yopenalex-snapshot
Approximation algorithm for the partial set multi-cover problem
inferred← citeshttps://doi.org/10.1007/s43069-023-00285-6openalex-snapshot
On Rooted k-Connectivity Problems in Quasi-Bipartite Digraphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.03.001openalex-snapshot
Covering problems in edge- and node-weighted graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106532openalex-snapshot
A 22k -approximation algorithm for minimum power k edge disjoint st-paths
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.009openalex-snapshot
Improved approximation algorithms for Directed Steiner Forest
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.054openalex-snapshot
Survivable network activation problems
inferred← citeshttps://doi.org/10.1109/focs.2012.61openalex-snapshot
Everywhere-Sparse Spanners via Dense Subgraphs
inferred← citeshttps://doi.org/10.1109/focs.2013.66openalex-snapshot
Online Node-Weighted Steiner Forest and Extensions via Disk Paintings
inferred← citeshttps://doi.org/10.1109/tpds.2013.108openalex-snapshot
An Approximation Algorithm for Constructing Degree-Dependent Node-Weighted Multicast Trees
inferred← citeshttps://doi.org/10.1137/1.9781611973730.2openalex-snapshot
Spider covers for prize-collecting network activation problem
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch94openalex-snapshot
Approximation Algorithms for Steiner Tree Augmentation Problems
inferred← citeshttps://doi.org/10.1137/14098692xopenalex-snapshot
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
inferred← citeshttps://doi.org/10.1137/16m1096402openalex-snapshot
The Densest $k$-Subhypergraph Problem
inferred← citeshttps://doi.org/10.1145/2390176.2390177openalex-snapshot
Approximating minimum-cost connectivity problems via uncrossable bifamilies
inferred← citeshttps://doi.org/10.1145/3132742openalex-snapshot
Spider Covers for Prize-Collecting Network Activation Problem
inferred← citeshttps://doi.org/10.1145/3447959openalex-snapshot
Node-weighted Network Design in Planar and Minor-closed Families of Graphs
inferred← citeshttps://doi.org/10.1201/9781351235426-15openalex-snapshot
Activation Network Design Problems
inferred← citeshttps://doi.org/10.1287/ijoc.2020.0975openalex-snapshot
Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
inferred← citeshttps://doi.org/10.1287/moor.2024.0837openalex-snapshot
Approximation Algorithms for Steiner Connectivity Augmentation
inferred← citeshttps://doi.org/10.48550/arxiv.1104.3923openalex-snapshot
An improved approximation algorithm for the minimum-cost subset k-connected subgraph problem
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0144openalex-snapshot
Everywhere-Sparse Spanners via Dense Subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.4123openalex-snapshot
Covering problems in edge- and node-weighted graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1704.08620openalex-snapshot
Improved approximation algorithm for the Dense-3-Subhypergraph Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1811.11700openalex-snapshot
Approximation algorithms for the vertex-weighted grade-of-service Steiner tree problem
inferred← citeshttps://doi.org/10.48550/arxiv.2111.04011openalex-snapshot
$k$ disjoint $st$-paths activation in polynomial time
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.