On the public citation graph
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs
0 signed · 50 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/978-3-642-15369-3_14openalex-snapshot
Improved Lower Bounds for the Universal and a priori TSP
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_7openalex-snapshot
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs
inferredcites →https://doi.org/10.1007/s00224-010-9283-6openalex-snapshot
Strong-Diameter Decompositions of Minor Free Graphs
inferredcites →https://doi.org/10.1007/s00453-005-1155-0openalex-snapshot
Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk
inferredcites →https://doi.org/10.1016/0167-6377(89)90047-3openalex-snapshot
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
inferredcites →https://doi.org/10.1016/s0020-0190(01)00161-2openalex-snapshot
On approximating planar metrics by tree metrics
inferredcites →https://doi.org/10.1109/focs.2008.62openalex-snapshot
Nearly Tight Low Stretch Spanning Trees
inferredcites →https://doi.org/10.1109/focs.2009.41openalex-snapshot
An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk
inferredcites →https://doi.org/10.1109/focs.2010.62openalex-snapshot
One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk
inferredcites →https://doi.org/10.1109/focs.2012.45openalex-snapshot
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs
inferredcites →https://doi.org/10.1109/mcsa.2002.1017485openalex-snapshot
Supporting aggregate queries over ad-hoc wireless sensor networks
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.1998.743488openalex-snapshot
Approximating a finite metric by a small number of tree metrics
inferredcites →https://doi.org/10.1109/sfcs.2002.1181881openalex-snapshot
Minimizing congestion in general networks
inferredcites →https://doi.org/10.1109/tc.2011.64openalex-snapshot
An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/s0097539792224474openalex-snapshot
A Graph-Theoretic Game and Its Application to the k -Server Problem
inferredcites →https://doi.org/10.1145/1039488.1039493openalex-snapshot
Compact oracles for reachability and approximate distances in planar digraphs
inferredcites →https://doi.org/10.1145/1060590.1060649openalex-snapshot
Universal approximations for TSP, Steiner tree, and set cover
inferredcites →https://doi.org/10.1145/1109557.1109628openalex-snapshot
Improved lower and upper bounds for universal TSP in planar metrics
inferredcites →https://doi.org/10.1145/1132516.1132557openalex-snapshot
Advances in metric embedding theory
inferredcites →https://doi.org/10.1145/1146381.1146411openalex-snapshot
Object location using path separators
inferredcites →https://doi.org/10.1145/1248377.1248381openalex-snapshot
Strong-diameter decompositions of minor free graphs
inferredcites →https://doi.org/10.1145/1281100.1281112openalex-snapshot
Improved sparse covers for graphs excluding a fixed minor
inferredcites →https://doi.org/10.1145/167088.167261openalex-snapshot
Excluded minors, network decomposition, and multicommodity flow
inferredcites →https://doi.org/10.1145/2213977.2214015openalex-snapshot
Using petal-decompositions to build a low stretch spanning tree
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/76359.76361openalex-snapshot
Spacefilling curves and the planar travelling salesman problem
inferredcites →https://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.48550/arxiv.1011.3770openalex-snapshot
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP
inferredcites →https://doi.org/10.5555/1109557.1109628openalex-snapshot
Improved lower and upper bounds for universal TSP in planar metrics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_15openalex-snapshot
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.005openalex-snapshot
A fast network-decomposition algorithm and its applications to constant-time distributed computation
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00012openalex-snapshot
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
inferred← citeshttps://doi.org/10.1145/2933057.2933094openalex-snapshot
Distributed Strong Diameter Network Decomposition
inferred← citeshttps://doi.org/10.1145/3519935.3520042openalex-snapshot
Locality-sensitive orderings and applications to reliable spanners
inferred← citeshttps://doi.org/10.1145/3572840openalex-snapshot
Universal Algorithms for Clustering Problems
inferred← citeshttps://doi.org/10.1145/3672562openalex-snapshot
Scattering and Sparse Partitions, and Their Applications
inferred← citeshttps://doi.org/10.1145/3717823.3718252openalex-snapshot
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
inferred← citeshttps://doi.org/10.1145/3717823.3718312openalex-snapshot
Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.6openalex-snapshot
On Strong Diameter Padded Decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1111.4766openalex-snapshot
On Strong Graph Partitions and Universal Steiner Trees
showing the first 11 of 12 · page through all 12
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.