On the public citation graph

A polynomial time approximation scheme for euclidean minimum cost k-connectivity

https://doi.org/10.1007/bfb0055093
0 signed · 27 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.1007/3-540-63248-4_5openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1109/sfcs.1996.548458openalex-snapshot
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1109/sfcs.1997.646145openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1137/s0097539796309764openalex-snapshot
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k -MST, and Related Problems
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard 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/3-540-45022-x_72openalex-snapshot
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_16openalex-snapshot
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_2openalex-snapshot
Approximation Schemes for Geometric NP-Hard Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_25openalex-snapshot
Finding k-Connected Subgraphs with Minimum Average Weight
inferred← citeshttps://doi.org/10.1007/978-3-642-30054-7_29openalex-snapshot
Relay Placement for Two-Connectivity
inferred← citeshttps://doi.org/10.1007/s00453-004-1103-4openalex-snapshot
Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems
inferred← citeshttps://doi.org/10.1007/s00453-014-9906-4openalex-snapshot
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing
inferred← citeshttps://doi.org/10.1007/s10107-003-0438-yopenalex-snapshot
Approximation schemes for NP-hard geometric optimization problems: a survey
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.06.002openalex-snapshot
Relay placement for two-connectivity
inferred← citeshttps://doi.org/10.1109/focs.2013.80openalex-snapshot
A Linear Time Approximation Scheme for Euclidean TSP
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00043openalex-snapshot
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
inferred← citeshttps://doi.org/10.1109/tnet.2009.2024941openalex-snapshot
Deploying Sensor Networks With Guaranteed Fault Tolerance
inferred← citeshttps://doi.org/10.1137/1.9781611973075.33openalex-snapshot
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
inferred← citeshttps://doi.org/10.1145/1062689.1062729openalex-snapshot
Deploying sensor networks with guaranteed capacity and fault tolerance
inferred← citeshttps://doi.org/10.1145/1347082.1347158openalex-snapshot
Approximating TSP on metrics with bounded global growth
inferred← citeshttps://doi.org/10.1145/2213977.2214038openalex-snapshot
The traveling salesman problem
inferred← citeshttps://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferred← citeshttps://doi.org/10.1145/3766548openalex-snapshot
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
inferred← citeshttps://doi.org/10.1201/9781351235426-2openalex-snapshot
Approximation Schemes for Minimum-Cost k -Connectivity Problems in Geometric Graphs
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2017.3openalex-snapshot
A PTAS for Three-Edge Connectivity in Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1701.08315openalex-snapshot
Linear-time approximation schemes for planar minimum three-edge connected and three-vertex connected spanning subgraphs
inferred← citeshttps://doi.org/10.7301/z0jm27wjopenalex-snapshot
Approximation Schemes for Euclidean Vehicle Routing Problems.
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.