On the public citation graph
Low Complexity Variants of the Arrow Distributed Directory
0 signed · 30 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/net.3230080402openalex-snapshot
The complexity of the network design problem
inferredcites →https://doi.org/10.1007/bfb0055092openalex-snapshot
Deterministic polylog approximation for minimum communication spanning trees
inferredcites →https://doi.org/10.1007/bfb0056478openalex-snapshot
The arrow distributed directory protocol
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.1137/0601008openalex-snapshot
Worst-Case Analysis of Network Design Problem Heuristics
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.1137/s009753979732253xopenalex-snapshot
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
inferredcites →https://doi.org/10.1145/100216.100268openalex-snapshot
On the power of randomization in online algorithms
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1002/cpe.8106openalex-snapshot
New parallelism and heuristic approaches for generating tree t‐spanners in graphs
inferred← citeshttps://doi.org/10.1007/11602613_109openalex-snapshot
Combinatorial Network Abstraction by Trees and Distances
inferred← citeshttps://doi.org/10.1007/978-3-319-26690-9_39openalex-snapshot
Genetic Algorithms for the Tree T-Spanner Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_15openalex-snapshot
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_18openalex-snapshot
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
inferred← citeshttps://doi.org/10.1007/s00453-013-9765-4openalex-snapshot
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.025openalex-snapshot
Tree spanners of bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.02.008openalex-snapshot
On approximating tree spanners that are breadth first search trees
inferred← citeshttps://doi.org/10.1016/j.jocs.2024.102281openalex-snapshot
Graph admissibility: Case generation and analysis by learning models
inferred← citeshttps://doi.org/10.1016/j.swevo.2016.06.005openalex-snapshot
Genetic algorithms to balanced tree structures in graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.037openalex-snapshot
Combinatorial network abstraction by trees and distances
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.007openalex-snapshot
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
inferred← citeshttps://doi.org/10.1137/060666202openalex-snapshot
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975482.146openalex-snapshot
Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees
inferred← citeshttps://doi.org/10.5555/982792.982829openalex-snapshot
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
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.