On the public citation graph

Pruning 2-Connected Graphs

https://doi.org/10.1007/s00453-010-9462-5
0 signed · 44 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.1006/jcss.1997.1542openalex-snapshot
A Constant-Factor Approximation Algorithm for thek-MST Problem
inferredcites →https://doi.org/10.1007/978-1-4615-0897-7_2openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-85363-3_19openalex-snapshot
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
inferredcites →https://doi.org/10.1007/s004530010050openalex-snapshot
The Dense k -Subgraph 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.1007/s10107-003-0479-2openalex-snapshot
Approximate k -MSTs and k -Steiner trees via the primal-dual method and Lagrangean relaxation
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0095-8956(81)90058-7openalex-snapshot
Nowhere-zero 6-flows
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.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/focs.2006.15openalex-snapshot
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
inferredcites →https://doi.org/10.1109/sfcs.1996.548489openalex-snapshot
A 3-approximation for the minimum tree spanning k vertices
inferredcites →https://doi.org/10.1109/sfcs.2003.1238179openalex-snapshot
Paths, trees, and minimum latency tours
inferredcites →https://doi.org/10.1109/sfcs.2003.1238180openalex-snapshot
Approximation algorithms for orienteering and discounted-reward TSP
inferredcites →https://doi.org/10.1137/050645464openalex-snapshot
Approximation Algorithms for Orienteering and Discounted-Reward TSP
inferredcites →https://doi.org/10.1137/070700620openalex-snapshot
Survivable Network Design with Degree or Order Constraints
inferredcites →https://doi.org/10.1137/090750317openalex-snapshot
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
inferredcites →https://doi.org/10.1137/1.9780898714906openalex-snapshot
Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
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.1137/s009753979528826xopenalex-snapshot
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
inferredcites →https://doi.org/10.1137/s009753979833920xopenalex-snapshot
Approximating Minimum-Size k -Connected Spanning Subgraphs via Matching
inferredcites →https://doi.org/10.1137/s0895480194266331openalex-snapshot
Spanning Trees—Short or Small
inferredcites →https://doi.org/10.1145/1007352.1007385openalex-snapshot
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
inferredcites →https://doi.org/10.1145/103418.103437openalex-snapshot
When trees collide
inferredcites →https://doi.org/10.1145/1060590.1060650openalex-snapshot
Saving an epsilon
inferredcites →https://doi.org/10.1145/1109557.1109626openalex-snapshot
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
inferredcites →https://doi.org/10.1145/1374376.1374401openalex-snapshot
An o(log 2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
inferredcites →https://doi.org/10.1145/1921659.1921664openalex-snapshot
Set connectivity problems in undirected graphs and the directed steiner network problem
inferredcites →https://doi.org/10.1145/2229163.2229167openalex-snapshot
Improved algorithms for orienteering and related problems
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1201/9781420010749openalex-snapshot
Handbook of Approximation Algorithms and Metaheuristics
inferredcites →https://doi.org/10.1201/9781420010749-68openalex-snapshot
Approximating Minimum-Cost Connectivity Problems
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.5555/1109557.1109626openalex-snapshot
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
inferredcites →https://doi.org/10.5555/1283383.1283519openalex-snapshot
Approximation algorithms for node-weighted buy-at-bulk network design
inferredcites →https://doi.org/10.5555/338219.338637openalex-snapshot
The prize collecting Steiner tree problem: theory and practice

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.4536619openalex-extracted
2-Node-Connectivity Network Design
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_15openalex-snapshot
2-Node-Connectivity Network Design
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.1016/j.tcs.2011.08.021openalex-snapshot
Approximating fault-tolerant group-Steiner problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114367openalex-snapshot
2-node-connectivity network design
inferred← citeshttps://doi.org/10.1145/1250790.1250886openalex-snapshot
Survivable network design with degree or order constraints
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.