On the public citation graph

Deterministic polylog approximation for minimum communication spanning trees

0 signed · 57 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.1002/net.3230080402openalex-snapshot
The complexity of the network design problem
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/bf01200760openalex-snapshot
Packing directed circuits fractionally
inferredcites →https://doi.org/10.1007/bf02776078openalex-snapshot
On lipschitz embedding of finite metric spaces in Hilbert space
inferredcites →https://doi.org/10.1109/sfcs.1995.492463openalex-snapshot
Divide-and-conquer approximation algorithms via spreading metrics
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.1137/s009753979732253xopenalex-snapshot
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
inferredcites →https://doi.org/10.1145/276698.276719openalex-snapshot
Rounding via trees
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nav.20302openalex-snapshot
Network design for time‐constrained delivery
inferred← citeshttps://doi.org/10.1002/net.10019openalex-snapshot
Light graphs with small routing cost
inferred← citeshttps://doi.org/10.1002/net.20313openalex-snapshot
Minimax flow tree problems
inferred← citeshttps://doi.org/10.1002/net.v54:3openalex-snapshot
inferred← citeshttps://doi.org/10.1006/jcss.2001.1787openalex-snapshot
Low Complexity Variants of the Arrow Distributed Directory
inferred← citeshttps://doi.org/10.1007/10721187_12openalex-snapshot
A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_5openalex-snapshot
Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_16openalex-snapshot
Minimum Restricted Diameter Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_58openalex-snapshot
A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_12openalex-snapshot
On the Approximability of the Minimum Fundamental Cycle Basis Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_3openalex-snapshot
As Good as It Gets: Competitive Fault Tolerance in Network Structures
inferred← citeshttps://doi.org/10.1007/s10479-006-7382-1openalex-snapshot
Algorithms for the optimum communication spanning tree problem
inferred← citeshttps://doi.org/10.1007/s11276-009-0201-2openalex-snapshot
Tree-based object tracking without mobility statistics in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11750-009-0112-5openalex-snapshot
Lagrangean bounds for the optimum communication spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.cor.2005.06.007openalex-snapshot
Designing a road network for hazardous materials shipments
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.08.008openalex-snapshot
Models and algorithms for network reduction
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.07.055openalex-snapshot
Solving the optimum communication spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.peva.2021.102238openalex-snapshot
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion
inferred← citeshttps://doi.org/10.1016/j.swevo.2011.10.003openalex-snapshot
Using penalties instead of rewards: Solving OCST problems with guided local search
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00360-3openalex-snapshot
Minimum restricted diameter spanning trees
inferred← citeshttps://doi.org/10.1109/aspdac.2007.357982openalex-snapshot
Topology exploration for energy efficient intra-tile communication
inferred← citeshttps://doi.org/10.1109/focs.2008.62openalex-snapshot
Nearly Tight Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1109/icon.2008.4772570openalex-snapshot
HiOPS overlay - efficient provision of multicast in peer-to-peer systems
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566857openalex-snapshot
Shortest path versus multi-hub routing in networks with uncertain demand
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743488openalex-snapshot
Approximating a finite metric by a small number of tree metrics
inferred← citeshttps://doi.org/10.1109/tevc.2006.871250openalex-snapshot
The edge-window-decoder representation for tree-based problems
inferred← citeshttps://doi.org/10.1109/tevc.2008.2008799openalex-snapshot
On the Bias and Performance of the Edge-Set Encoding
inferred← citeshttps://doi.org/10.1109/tevc.2010.2093580openalex-snapshot
Edge Orientation and the Design of Problem-Specific Crossover Operators for the OCST Problem
inferred← citeshttps://doi.org/10.1109/tnet.2014.2353576openalex-snapshot
Shortest Path Versus Multihub Routing in Networks With Uncertain Demand
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.1142/9789814273510_0015openalex-snapshot
A Benders' Partitioning Approach for Solving the Optimal Communication Spanning Tree Problem
inferred← citeshttps://doi.org/10.1145/1060590.1060665openalex-snapshot
Lower-stretch spanning trees
inferred← citeshttps://doi.org/10.1145/1389095.1389205openalex-snapshot
Orientation matters
inferred← citeshttps://doi.org/10.1145/1569901.1569951openalex-snapshot
New insights into the OCST problem
inferred← citeshttps://doi.org/10.1145/3313276.3316381openalex-snapshot
Dynamic low-stretch trees via dynamic low-diameter decompositions
inferred← citeshttps://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferred← citeshttps://doi.org/10.11606/d.45.2021.tde-10032022-204719openalex-snapshot
Optimal Communication Spanning Tree
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0310openalex-snapshot
An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2018.0827openalex-snapshot
New Valid Inequalities for the Optimal Communication Spanning Tree Problem
inferred← citeshttps://doi.org/10.1287/opre.1080.0592openalex-snapshot
On Optimal Solutions for the Optimal Communication Spanning Tree Problem
inferred← citeshttps://doi.org/10.4171/mems/11openalex-snapshot
Extension, Separation and Isomorphic Reverse Isoperimetry
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.1302.7028openalex-snapshot
Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand
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.5555/1109557.1109673openalex-snapshot
A tight upper bound on the probabilistic embedding of series-parallel graphs
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96254openalex-snapshot
The Optimum Communication Spanning Tree Problem : properties, models and algorithms
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.