On the public citation graph

Lower-Stretch Spanning Trees

0 signed · 116 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/bf01200760openalex-snapshot
Packing directed circuits fractionally
inferredcites →https://doi.org/10.1007/s00493-004-0015-xopenalex-snapshot
Cuts, Trees and ℓ1-Embeddings of Graphs*
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1137/0203015openalex-snapshot
Optimum Communication Spanning Trees
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/1007352.1007372openalex-snapshot
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/347476.347478openalex-snapshot
Divide-and-conquer approximation algorithms via spreading metrics
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.5555/1109557.1109673openalex-snapshot
A tight upper bound on the probabilistic embedding of series-parallel graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4814558openalex-extracted
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
inferred← citeshttps://doi.org/10.1002/cpe.70019openalex-snapshot
On Reducing Stretch in Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-1168-0_15openalex-snapshot
Numerical Thinking in Algorithm Design and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_23openalex-snapshot
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_15openalex-snapshot
2-Node-Connectivity Network Design
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_11openalex-snapshot
Distributed Approximation of Minimum Routing Cost Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_18openalex-snapshot
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_2openalex-snapshot
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
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-31265-6_6openalex-snapshot
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_5openalex-snapshot
Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations
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-010-9423-zopenalex-snapshot
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
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.1007/s10107-018-1259-3openalex-snapshot
The ordered k-median problem: surrogate models and approximation algorithms
inferred← citeshttps://doi.org/10.1007/s10107-022-01780-0openalex-snapshot
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
inferred← citeshttps://doi.org/10.1007/s10107-025-02298-xopenalex-snapshot
Approximation algorithms for network design in non-uniform fault models
inferred← citeshttps://doi.org/10.1007/s11590-018-1340-0openalex-snapshot
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem
inferred← citeshttps://doi.org/10.1016/j.cag.2020.02.004openalex-snapshot
Spectrum-preserving sparsification for visualization of big graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2009.08.001openalex-snapshot
Cycle bases in graphs characterization, algorithms, complexity, and applications
inferred← citeshttps://doi.org/10.1016/j.dam.2023.11.011openalex-snapshot
Minimum spanning tree cycle intersection problem on outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.09.003openalex-snapshot
Integral cycle bases for cyclic timetabling
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.10.021openalex-snapshot
Spanners of bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.10.002openalex-snapshot
Spanners in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.04.006openalex-snapshot
On notions of distortion and an almost minimum spanning tree with constant average distortion
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103814openalex-snapshot
Temporal graph realization with bounded stretch
inferred← citeshttps://doi.org/10.1016/j.sorms.2010.06.001openalex-snapshot
Approximation algorithms for network design: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.021openalex-snapshot
Approximating fault-tolerant group-Steiner problems
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.1016/j.tcs.2017.06.021openalex-snapshot
Terminal embeddings
inferred← citeshttps://doi.org/10.1049/iet-wss.2018.5116openalex-snapshot
Self‐stabilising hybrid connectivity control protocol for WSNs
inferred← citeshttps://doi.org/10.1089/cmb.2013.0064openalex-snapshot
The Approximability of Shortest Path-Based Graph Orientations of Protein–Protein Interaction Networks
inferred← citeshttps://doi.org/10.1109/dac.2018.8465798openalex-snapshot
Similarity-Aware Spectral Sparsification by Edge Filtering
inferred← citeshttps://doi.org/10.1109/focs.2008.62openalex-snapshot
Nearly Tight Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1109/focs.2010.29openalex-snapshot
Approaching Optimality for Solving SDD Linear Systems
inferred← citeshttps://doi.org/10.1109/focs.2011.18openalex-snapshot
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones
inferred← citeshttps://doi.org/10.1109/focs.2012.45openalex-snapshot
Split and Join: Strong Partitions and Universal Steiner Trees for Graphs
inferred← citeshttps://doi.org/10.1109/focs.2012.61openalex-snapshot
Everywhere-Sparse Spanners via Dense Subgraphs
inferred← citeshttps://doi.org/10.1109/focs.2016.44openalex-snapshot
On Fully Dynamic Graph Sparsifiers
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00107openalex-snapshot
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications
inferred← citeshttps://doi.org/10.1109/iccad.2011.6105383openalex-snapshot
Power grid analysis with hierarchical support graphs
inferred← citeshttps://doi.org/10.1109/iscas.2017.8050468openalex-snapshot
Efficient spectral graph sparsification via Krylov-subspace based spectral perturbation analysis
inferred← citeshttps://doi.org/10.1109/pdp55904.2022.00019openalex-snapshot
A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality
inferred← citeshttps://doi.org/10.1109/peci.2015.7064885openalex-snapshot
Computationally efficient solvers for power system applications
inferred← citeshttps://doi.org/10.1109/tcad.2020.2968543openalex-snapshot
GRASS: Graph Spectral Sparsification Leveraging Scalable Spectral Perturbation Analysis
inferred← citeshttps://doi.org/10.1109/tcad.2021.3060647openalex-snapshot
feGRASS: Fast and Effective Graph Spectral Sparsification for Scalable Power Grid Analysis
inferred← citeshttps://doi.org/10.1109/tpwrs.2019.2934705openalex-snapshot
State Estimation for Large-Scale Power Systems and FACTS Devices Based on Spanning Tree Maximum Exponential Absolute Value
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0331openalex-snapshot
A Subgraph Preconditioning Algorithm for Large Linear Systems
inferred← citeshttps://doi.org/10.1137/090745441openalex-snapshot
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1137/090771430openalex-snapshot
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch62openalex-snapshot
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion
inferred← citeshttps://doi.org/10.1137/1.9781611975031.108openalex-snapshot
Ramsey Spanning Trees and Their Applications
inferred← citeshttps://doi.org/10.1137/1.9781611975994.64openalex-snapshot
Lossless Prioritized Embeddings
inferred← citeshttps://doi.org/10.1137/1.9781611976465.174openalex-snapshot
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
inferred← citeshttps://doi.org/10.1137/1.9781611977073.129openalex-snapshot
Partially Optimal Edge Fault-Tolerant Spanners
inferred← citeshttps://doi.org/10.1137/110845914openalex-snapshot
Approaching Optimality for Solving SDD Linear Systems
inferred← citeshttps://doi.org/10.1137/13094791xopenalex-snapshot
Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones
inferred← citeshttps://doi.org/10.1137/19m1286955openalex-snapshot
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
inferred← citeshttps://doi.org/10.1137/21m1436221openalex-snapshot
Lossless Prioritized Embeddings
inferred← citeshttps://doi.org/10.1137/21m1442176openalex-snapshot
Reachability Preservers: New Extremal Bounds and Approximation Algorithms
inferred← citeshttps://doi.org/10.1137/22m1489034openalex-snapshot
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
inferred← citeshttps://doi.org/10.1137/22m1503932openalex-snapshot
Solving Graph Laplacians via Multilevel Sparsifiers
inferred← citeshttps://doi.org/10.1142/9789814324359_0005openalex-snapshot
The work of Daniel A. Spielman
inferred← citeshttps://doi.org/10.1142/9789814324359_0164openalex-snapshot
Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices
inferred← citeshttps://doi.org/10.1145/1980522.1980524openalex-snapshot
The price of anarchy in cooperative network creation games
inferred← citeshttps://doi.org/10.1145/1993636.1993680openalex-snapshot
Directed spanners via flow-based linear programs
inferred← citeshttps://doi.org/10.1145/1993806.1993830openalex-snapshot
Fault-tolerant spanners
inferred← citeshttps://doi.org/10.1145/2344422.2344425openalex-snapshot
Fully dynamic randomized algorithms for graph spanners
inferred← citeshttps://doi.org/10.1145/2486159.2486180openalex-snapshot
Parallel graph decompositions using random shifts
inferred← citeshttps://doi.org/10.1145/2591796.2591833openalex-snapshot
Solving SDD linear systems in nearly m log 1/2 n time
inferred← citeshttps://doi.org/10.1145/2897937.2898094openalex-snapshot
Spectral graph sparsification in nearly-linear time leveraging efficient spectral perturbation analysis
inferred← citeshttps://doi.org/10.1145/3195970.3196114openalex-snapshot
Similarity-aware spectral sparsification by edge filtering
inferred← citeshttps://doi.org/10.1145/3313276.3316381openalex-snapshot
Dynamic low-stretch trees via dynamic low-diameter decompositions
inferred← citeshttps://doi.org/10.1145/3316781.3317809openalex-snapshot
Effective-Resistance Preserving Spectral Reduction of Graphs
inferred← citeshttps://doi.org/10.1145/3406325.3451043openalex-snapshot
Clan embeddings into trees, and low treewidth graphs
inferred← citeshttps://doi.org/10.1145/3406325.3451053openalex-snapshot
Tree embeddings for hop-constrained network design
inferred← citeshttps://doi.org/10.1145/3519935.3520047openalex-snapshot
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel
inferred← citeshttps://doi.org/10.1145/3627708openalex-snapshot
“Intelligent Heuristics Are the Future of Computing”
inferred← citeshttps://doi.org/10.1145/3639568openalex-snapshot
diGRASS: Di rected Gra ph S pectral S parsification via Spectrum-Preserving Symmetrization
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.1145/3750728openalex-snapshot
Color Fault-Tolerant Spanners
inferred← citeshttps://doi.org/10.1184/r1/6714635openalex-snapshot
Algorithm Design Using Spectral Graph Theory
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.13130/zappella-giovanni_phd2014-03-28openalex-snapshot
LEARNING ON GRAPHS: ALGORITHMS FOR CLASSIFICATION AND SEQUENTIAL DECISIONS
inferred← citeshttps://doi.org/10.1561/9781680831313openalex-snapshot
Scalable Algorithms for Data and Network Analysis
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18379openalex-snapshot
Expected Path Degradation when Searching over a Sparse Grid Hierarchy
inferred← citeshttps://doi.org/10.4018/978-1-60566-697-6.ch015openalex-snapshot
Event-Based System Architecture in Mobile Ad Hoc Networks (MANETs)
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.6openalex-snapshot
On Strong Diameter Padded Decompositions
inferred← citeshttps://doi.org/10.4230/lipics.swat.2020.15openalex-snapshot
Low-Stretch Spanning Trees of Graphs with Bounded Width
inferred← citeshttps://doi.org/10.48550/arxiv.1101.5753openalex-snapshot
Fault-Tolerant Spanners: Better and Simpler
inferred← citeshttps://doi.org/10.48550/arxiv.1111.4766openalex-snapshot
On Strong Graph Partitions and Universal Steiner Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0144openalex-snapshot
Everywhere-Sparse Spanners via Dense Subgraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4767openalex-snapshot
A Linear Time Active Learning Algorithm for Link Classification -- Full Version --
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4769openalex-snapshot
A Correlation Clustering Approach to Link Classification in Signed Networks -- Full Version --
inferred← citeshttps://doi.org/10.48550/arxiv.1307.3692openalex-snapshot
Parallel Graph Decompositions Using Random Shifts
inferred← citeshttps://doi.org/10.48550/arxiv.1608.03384openalex-snapshot
The DFS Fused Lasso: Linear-Time Denoising over General Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1812.04165openalex-snapshot
A Unified Approach to Scalable Spectral Sparsification of Directed Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06413openalex-snapshot
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
inferred← citeshttps://doi.org/10.48550/arxiv.1909.09002openalex-snapshot
Low Diameter Graph Decompositions by Approximate Distance Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1910.07950openalex-snapshot
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
inferred← citeshttps://doi.org/10.48550/arxiv.2008.07633openalex-snapshot
SF-GRASS: Solver-Free Graph Spectral Sparsification
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05168openalex-snapshot
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0703119openalex-snapshot
Support-Graph Preconditioners for 2-Dimensional Trusses
inferred← citeshttps://doi.org/10.5555/2884435.2884497openalex-snapshot
On notions of distortion and an almost minimum spanning tree with constant average distortion
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.