On the public citation graph

Approximation algorithm for k-node connected subgraphs via critical graphs

https://doi.org/10.1145/1007352.1007381
0 signed · 38 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/jagm.1996.0052openalex-snapshot
Improved Approximation Algorithms for Uniform Connectivity Problems
inferredcites →https://doi.org/10.1006/jagm.1999.1006openalex-snapshot
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
inferredcites →https://doi.org/10.1006/jctb.1995.1002openalex-snapshot
On the Optimal Vertex-Connectivity Augmentation
inferredcites →https://doi.org/10.1006/jctb.1995.1044openalex-snapshot
Minimal Edge-Coverings of Pairs of Sets
inferredcites →https://doi.org/10.1006/jctb.2002.2129openalex-snapshot
On k-con-Critically n-Connected Graphs
inferredcites →https://doi.org/10.1007/3-540-40996-3_27openalex-snapshot
A Near Optimal Algorithm for Vertex Connectivity Augmentation
inferredcites →https://doi.org/10.1007/bf01304873openalex-snapshot
Ecken vom Gradn in minimalenn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01351600openalex-snapshot
Endlichkeitss�tze f�rk-kritische Graphen
inferredcites →https://doi.org/10.1007/bf02523686openalex-snapshot
An approximation algorithm for minimum-cost vertex-connectivity problems
inferredcites →https://doi.org/10.1007/s003730200000openalex-snapshot
A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity
inferredcites →https://doi.org/10.1007/s003730200008openalex-snapshot
Upper Bounds to the Number of Vertices in a k -Critically n -Connected Graph
inferredcites →https://doi.org/10.1007/s00453-001-0017-7openalex-snapshot
On Rooted Node-Connectivity Problems
inferredcites →https://doi.org/10.1007/s00453-002-0970-9openalex-snapshot
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
inferredcites →https://doi.org/10.1007/s00453-003-1027-4openalex-snapshot
Approximating Node Connectivity Problems via Set Covers
inferredcites →https://doi.org/10.1007/s00493-004-0027-6openalex-snapshot
High Connectivity Keeping Sets In n-Connected Graphs
inferredcites →https://doi.org/10.1016/0012-365x(77)90065-6openalex-snapshot
On k-critical, n-connected graphs
inferredcites →https://doi.org/10.1016/0024-3795(89)90469-2openalex-snapshot
An application of submodular flows
inferredcites →https://doi.org/10.1016/0095-8956(85)90076-0openalex-snapshot
Minimal n-fach zusammenhängende Digraphen
inferredcites →https://doi.org/10.1016/s0012-365x(97)00100-3openalex-snapshot
On the existence of (k, l)-critical graphs
inferredcites →https://doi.org/10.1017/cbo9780511662133.005openalex-snapshot
Connectivity and edge-connectivity in finite graphs
inferredcites →https://doi.org/10.1137/s009753979833920xopenalex-snapshot
Approximating Minimum-Size k -Connected Spanning Subgraphs via Matching
inferredcites →https://doi.org/10.1145/509907.509955openalex-snapshot
Approximation algorithms for minimum-cost k-vertex connected subgraphs
inferredcites →https://doi.org/10.5555/214352.214357openalex-snapshot
Minimal Edge-Coverings of Pairs of Sets
inferredcites →https://doi.org/10.5555/313559.313753openalex-snapshot
A representation for crossing set families with applications to submodular flow problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11496915_26openalex-snapshot
Power Optimization for Connectivity Problems
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/11561071_43openalex-snapshot
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
inferred← citeshttps://doi.org/10.1007/11786986_39openalex-snapshot
Tight Approximation Algorithm for Connectivity Augmentation 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/s10107-006-0057-5openalex-snapshot
Power optimization for connectivity problems
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.jcss.2007.05.002openalex-snapshot
Tight approximation algorithm for connectivity augmentation problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.028openalex-snapshot
A simple randomized scheme for constructing low-weight k -connected spanning subgraphs with applications to distributed algorithms
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.1145/1060590.1060616openalex-snapshot
Approximation algorithms for network design with metric costs
inferred← citeshttps://doi.org/10.1145/1374376.1374401openalex-snapshot
An o(log 2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
inferred← citeshttps://doi.org/10.1201/9781420010749.ch58openalex-snapshot
Approximating Minimum-Cost Connectivity Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1208openalex-snapshot
A Deterministic Algorithm for the Vertex Connectivity Survivable Network Design Problem
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.