On the public citation graph
Reducing Curse of Dimensionality
0 signed · 42 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.1002/9781119005353.ch7openalex-snapshot
The Traveling Salesman Problem and its Variations
inferredcites →https://doi.org/10.1006/jagm.2000.1096openalex-snapshot
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
inferredcites →https://doi.org/10.1007/11523468_90openalex-snapshot
Approximation Algorithms for Euclidean Group TSP
inferredcites →https://doi.org/10.1007/11970125_6openalex-snapshot
On the minimum corridor connection and other generalized geometric problems
inferredcites →https://doi.org/10.1007/978-1-4613-0039-7openalex-snapshot
Lectures on Discrete Geometry
inferredcites →https://doi.org/10.1007/978-3-642-04295-9openalex-snapshot
Geometry of Cuts and Metrics
inferredcites →https://doi.org/10.1007/pl00009449openalex-snapshot
Nearest Neighbor Queries in Metric Spaces
inferredcites →https://doi.org/10.1007/s00037-005-0200-3openalex-snapshot
On the complexity of approximating tsp with neighborhoods and related problems
inferredcites →https://doi.org/10.1007/s00454-011-9337-9openalex-snapshot
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
inferredcites →https://doi.org/10.1016/0166-218x(94)90008-6openalex-snapshot
Approximation algorithms for the geometric covering salesman problem
inferredcites →https://doi.org/10.1016/j.aim.2011.08.003openalex-snapshot
Advances in metric embedding theory
inferredcites →https://doi.org/10.1016/j.comgeo.2009.05.001openalex-snapshot
On the minimum corridor connection problem and other generalized geometric problems
inferredcites →https://doi.org/10.1016/j.jalgor.2005.01.010openalex-snapshot
TSP with neighborhoods of varying size
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1016/s0196-6774(03)00047-6openalex-snapshot
Approximation algorithms for TSP with neighborhoods in the plane
inferredcites →https://doi.org/10.1109/focs.2013.80openalex-snapshot
A Linear Time Approximation Scheme for Euclidean TSP
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.2003.1238226openalex-snapshot
Bounded geometries, fractals, and low-distortion embeddings
inferredcites →https://doi.org/10.1137/130913328openalex-snapshot
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
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/1810959.1810992openalex-snapshot
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane
inferredcites →https://doi.org/10.1145/220279.220318openalex-snapshot
Approximation algorithms for geometric tour and network design problems (extended abstract)
inferredcites →https://doi.org/10.1145/276698.276868openalex-snapshot
Approximating geometrical graphs via “spanners” and “banyans”
inferredcites →https://doi.org/10.1145/780542.780628openalex-snapshot
Polylogarithmic inapproximability
inferredcites →https://doi.org/10.24033/bsmf.1997openalex-snapshot
Plongements lipschitziens dans ${\bbfR}\sp n$
inferredcites →https://doi.org/10.48550/arxiv.1703.01646openalex-snapshot
A PTAS for TSP with Neighborhoods Among Fat Regions in the Plane
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.06.014openalex-snapshot
Improved approximation for min-max k-path cover with neighborhoods: Leveraging refined geometric spanning and adaptive recombination
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106581openalex-snapshot
A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9030031openalex-snapshot
A Submodular Optimization Approach to the Metric Traveling Salesman Problem with Neighborhoods
inferred← citeshttps://doi.org/10.1109/focs.2018.00082openalex-snapshot
Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics
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/focs61266.2024.00107openalex-snapshot
Novel Properties of Hierarchical Probabilistic Partitions and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.1109/itca52113.2020.00008openalex-snapshot
Using Machine Learning to Identify Movie Genres through Online Movie Synopses
inferred← citeshttps://doi.org/10.1137/1.9781611975482.67openalex-snapshot
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
inferred← citeshttps://doi.org/10.1145/3717823.3718214openalex-snapshot
Near-Optimal Dimension Reduction for Facility Location
inferred← citeshttps://doi.org/10.1145/3766548openalex-snapshot
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
inferred← citeshttps://doi.org/10.15826/umj.2023.1.012openalex-snapshot
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
inferred← citeshttps://doi.org/10.3390/rs12101571openalex-snapshot
A New Identification Method for Surface Cracks from UAV Images Based on Machine Learning in Coal Mining Areas
inferred← citeshttps://doi.org/10.48550/arxiv.1804.02530openalex-snapshot
$\varepsilon$-Coresets for Clustering (with Outliers) in Doubling Metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1809.07159openalex-snapshot
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks
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.