On the public citation graph
A Ptas for K-Hop Mst on the Euclidean Plane: Improving Dependency on K
0 signed · 16 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.1007/11429647_9openalex-extracted
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
inferredcites →https://doi.org/10.1007/11758471_22openalex-extracted
Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems
inferredcites →https://doi.org/10.1007/3-540-48481-7_33openalex-extracted
A Nearly Linear-Time Approximation Scheme for the Euclidean k-median Problem
inferredcites →https://doi.org/10.1007/3-540-63248-4_5openalex-extracted
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1007/978-3-319-21840-3_12openalex-extracted
On the Bounded-Hop Range Assignment Problem
inferredcites →https://doi.org/10.1007/s00453-017-0370-9openalex-extracted
Bounded-Hop Communication Networks
inferredcites →https://doi.org/10.1016/j.comgeo.2019.01.003openalex-extracted
Minimizing the sum of distances to a server in a constraint network
inferredcites →https://doi.org/10.1016/j.orl.2004.05.005openalex-extracted
Approximating k-hop minimum-spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1996.548458openalex-extracted
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1109/sfcs.1997.646145openalex-extracted
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferredcites →https://doi.org/10.1109/vetecf.2004.1404638openalex-extracted
Twelve reasons not to route over many short hops
inferredcites →https://doi.org/10.1111/j.1475-3995.1999.tb00176.xopenalex-extracted
Approximating minimum spanning tree of depth 2
inferredcites →https://doi.org/10.1137/s0097539702404055openalex-extracted
A Nearly Linear-Time Approximation Scheme for the Euclidean k -Median Problem
inferredcites →https://doi.org/10.1145/276698.276718openalex-extracted
Approximation schemes for Euclidean k -medians and related problems
inferredcites →https://doi.org/10.1145/58564.59295openalex-extracted
A tree-based algorithm for distributed mutual exclusion
inferredcites →https://doi.org/10.4230/lipics.mfcs.2020.18openalex-extracted
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
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.