On the public citation graph
An approximation algorithm for minimum-cost vertex-connectivity problems
0 signed · 102 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.1993.1010openalex-snapshot
Approximation Algorithms for Graph Augmentation
inferredcites →https://doi.org/10.1006/jagm.1996.0052openalex-snapshot
Improved Approximation Algorithms for Uniform Connectivity Problems
inferredcites →https://doi.org/10.1006/jctb.1995.1002openalex-snapshot
On the Optimal Vertex-Connectivity Augmentation
inferredcites →https://doi.org/10.1007/bf01299747openalex-snapshot
A primal-dual approximation algorithm for generalized steiner network problems
inferredcites →https://doi.org/10.1016/0022-0000(93)90050-7openalex-snapshot
A minimum 3-connectivity augmentation of a graph
inferredcites →https://doi.org/10.1016/0024-3795(89)90469-2openalex-snapshot
An application of submodular flows
inferredcites →https://doi.org/10.1073/pnas.48.7.1142openalex-snapshot
THE MAXIMUM CONNECTIVITY OF A GRAPH
inferredcites →https://doi.org/10.1109/sfcs.1991.185418openalex-snapshot
A linear time algorithm for triconnectivity augmentation
inferredcites →https://doi.org/10.1109/sfcs.1992.267817openalex-snapshot
On four-connecting a triconnected graph
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tct.1969.1083004openalex-snapshot
The Design of Minimum-Cost Survivable Networks
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.1145/195058.195434openalex-snapshot
Improved data structures for fully dynamic biconnectivity
inferredcites →https://doi.org/10.1287/ijoc.8.1.29openalex-snapshot
Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
inferredcites →https://doi.org/10.1287/opre.37.4.531openalex-snapshot
Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints
inferredcites →https://doi.org/10.1287/opre.40.2.309openalex-snapshot
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.5555/313651.313714openalex-snapshot
An approximation algorithm for minimum-cost vertex-connectivity problems
inferredcites →https://doi.org/10.5555/313852.314074openalex-snapshot
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer
inferredcites →https://doi.org/10.5555/314464.314497openalex-snapshot
Improved approximation algorithms for network design 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/1097-0037(200010)36:3<172::aid-net4>3.0.co;2-popenalex-snapshot
Approximating multiroot 3-outconnected subgraphs
inferred← citeshttps://doi.org/10.1002/net.20072openalex-snapshot
Design of Survivable Networks: A survey
inferred← citeshttps://doi.org/10.1006/jagm.1999.1006openalex-snapshot
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
inferred← citeshttps://doi.org/10.1006/jagm.1999.1007openalex-snapshot
A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
inferred← citeshttps://doi.org/10.1006/jagm.1999.1040openalex-snapshot
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_20openalex-snapshot
Approximating Node Connectivity Problems via Set Covers
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_38openalex-snapshot
Approximation Algorithms for Minimum Size 2-Connectivity Problems
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_10openalex-snapshot
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_12openalex-snapshot
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_17openalex-snapshot
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_19openalex-snapshot
Approximation Algorithms for Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_23openalex-snapshot
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_36openalex-snapshot
Approximating Steiner Networks with Node Weights
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_22openalex-snapshot
Approximating Node-Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_2openalex-snapshot
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity
inferred← citeshttps://doi.org/10.1007/bfb0053965openalex-snapshot
Approximating k-outconnected subgraph problems
inferred← citeshttps://doi.org/10.1007/s00224-017-9786-5openalex-snapshot
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems
inferred← citeshttps://doi.org/10.1007/s00453-002-0970-9openalex-snapshot
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
inferred← citeshttps://doi.org/10.1007/s00453-003-1027-4openalex-snapshot
Approximating Node Connectivity Problems via Set Covers
inferred← citeshttps://doi.org/10.1007/s00453-011-9538-xopenalex-snapshot
Approximating Node-Connectivity Augmentation 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/s00493-014-2773-4openalex-snapshot
Approximating minimum-cost edge-covers of crossing biset-families
inferred← citeshttps://doi.org/10.1007/s10479-019-03175-5openalex-snapshot
RETRACTED ARTICLE: On the survivable network design problem with mixed connectivity requirements
inferred← citeshttps://doi.org/10.1016/j.adhoc.2014.07.003openalex-snapshot
A fault-tolerant relay placement algorithm for ensuring k vertex-disjoint shortest paths in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.10.002openalex-snapshot
A bad example for the iterative rounding method for mincost k -connected spanning subgraphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2005.01.008openalex-snapshot
A 4/3 -approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.05.006openalex-snapshot
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.08.007openalex-snapshot
An algorithm for (n−3) -connectivity augmentation problem: Jump system approach
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/s0166-218x(02)00199-3openalex-snapshot
Approximating minimum size {1,2}-connected networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00201-9openalex-snapshot
A primal–dual approximation algorithm for the survivable network design problem in hypergraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00580-2openalex-snapshot
On the minimum local-vertex-connectivity augmentation in graphs
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00045-xopenalex-snapshot
Faster approximation algorithms for weighted triconnectivity augmentation problems
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00222-5openalex-snapshot
A primal–dual schema based approximation algorithm for the element connectivity problem
inferred← citeshttps://doi.org/10.1109/focs.2008.63openalex-snapshot
Algorithms for Single-Source Vertex Connectivity
inferred← citeshttps://doi.org/10.1109/focs.2009.38openalex-snapshot
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
inferred← citeshttps://doi.org/10.1109/focs.2009.9openalex-snapshot
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
inferred← citeshttps://doi.org/10.1109/icc.2015.7249234openalex-snapshot
Critical resource multicast protection in data center networks
inferred← citeshttps://doi.org/10.1109/icnc.2012.11openalex-snapshot
Approximate Algorithms for Survivable Network Design
inferred← citeshttps://doi.org/10.1109/infcom.2007.195openalex-snapshot
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/infocom.2008.65openalex-snapshot
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements
inferred← citeshttps://doi.org/10.1109/mass.2011.137openalex-snapshot
Constrained Relay Node Placement in Energy Harvesting Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/ondm.2015.7127280openalex-snapshot
Static protection against single multicast resource failure
inferred← citeshttps://doi.org/10.1109/secon.2010.5508241openalex-snapshot
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492668openalex-snapshot
Fully dynamic biconnectivity and transitive closure
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743495openalex-snapshot
A factor 2 approximation algorithm for the generalized Steiner network problem
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959908openalex-snapshot
An iterative rounding 2-approximation algorithm for the element connectivity problem
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814571openalex-snapshot
Primal-dual approximation algorithms for metric facility location and k-median problems
inferred← citeshttps://doi.org/10.1109/tc.2011.123openalex-snapshot
Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks
inferred← citeshttps://doi.org/10.1109/tc.2012.170openalex-snapshot
An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks
inferred← citeshttps://doi.org/10.1109/tc.2013.171openalex-snapshot
Approximation Algorithms for Constrained Relay Node Placement in Energy Harvesting Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tmc.2009.161openalex-snapshot
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tmc.2011.126openalex-snapshot
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations
inferred← citeshttps://doi.org/10.1109/tnet.2009.2033273openalex-snapshot
Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations
inferred← citeshttps://doi.org/10.1109/wd.2011.6098176openalex-snapshot
Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks
inferred← citeshttps://doi.org/10.1111/itor.13511openalex-snapshot
Design of survivable networks with low connectivity requirements
inferred← citeshttps://doi.org/10.1137/080729645openalex-snapshot
Approximating Steiner Networks with Node-Weights
inferred← citeshttps://doi.org/10.1137/1.9781611975994.60openalex-snapshot
A 4 + ε approximation for k-connected subgraphs
inferred← citeshttps://doi.org/10.1137/100818728openalex-snapshot
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs
inferred← citeshttps://doi.org/10.1137/110855910openalex-snapshot
An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
inferred← citeshttps://doi.org/10.1137/s0097539701392287openalex-snapshot
An Approximation Algorithm for the Minimum-Cost k -Vertex Connected Subgraph
inferred← citeshttps://doi.org/10.1137/s0097539702416736openalex-snapshot
Hardness of Approximation for Vertex-Connectivity Network Design Problems
inferred← citeshttps://doi.org/10.1137/s0097539703435753openalex-snapshot
Approximating k -node Connected Subgraphs via Critical Graphs
inferred← citeshttps://doi.org/10.1145/1007352.1007381openalex-snapshot
Approximation algorithm for k-node connected subgraphs via critical graphs
inferred← citeshttps://doi.org/10.1145/1374376.1374403openalex-snapshot
Network design for vertex connectivity
inferred← citeshttps://doi.org/10.1145/2390176.2390177openalex-snapshot
Approximating minimum-cost connectivity problems via uncrossable bifamilies
inferred← citeshttps://doi.org/10.1145/509907.509955openalex-snapshot
Approximation algorithms for minimum-cost k-vertex connected subgraphs
inferred← citeshttps://doi.org/10.1145/513800.513816openalex-snapshot
Algorithmic aspects of topology control problems for ad hoc networks
inferred← citeshttps://doi.org/10.3390/jmse11081597openalex-snapshot
Assessing the Connectivity Reliability of a Maritime Transport Network: A Case of Imported Crude Oil in China
inferred← citeshttps://doi.org/10.48550/arxiv.1304.7571openalex-snapshot
Approximating {0,1,2}-Survivable Networks with Minimum Number of Steiner Points
inferred← citeshttps://doi.org/10.52159/realtech.v14i2.28openalex-snapshot
RELAY DEPLOYMENT ALGORITHMS IN WIRELESS SENSOR NETWORKS: A SURVEY
inferred← citeshttps://doi.org/10.5402/2012/932456openalex-snapshot
An Overview of Algorithms for Network Survivability
inferred← citeshttps://doi.org/10.5555/1070432.1070457openalex-snapshot
Approximating connectivity augmentation problems
inferred← citeshttps://doi.org/10.5555/1496770.1496869openalex-snapshot
An almost O(log k)-approximation for k-connected subgraphs
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.