On the public citation graph
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
0 signed · 31 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.1006/jagm.1998.0993openalex-snapshot
Greedy Strikes Back: Improved Facility Location Algorithms
inferredcites →https://doi.org/10.1006/jagm.2000.1100openalex-snapshot
Analysis of a Local Search Heuristic for Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-45753-4_20openalex-snapshot
Improved Approximation Algorithms for Metric Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-69346-7_14openalex-snapshot
Improved Approximation Algorithms for Uncapacitated Facility Location
inferredcites →https://doi.org/10.1016/0305-0548(94)00074-iopenalex-snapshot
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints
inferredcites →https://doi.org/10.1016/0306-4379(91)90030-dopenalex-snapshot
Compression of correlated bit-vectors
inferredcites →https://doi.org/10.1016/0377-2217(95)00090-9openalex-snapshot
Multicommodity flow models for spanning trees with hop constraints
inferredcites →https://doi.org/10.1016/j.orl.2004.05.005openalex-snapshot
Approximating k-hop minimum-spanning trees
inferredcites →https://doi.org/10.1016/s0166-218x(99)00111-0openalex-snapshot
Approximating the weight of shallow Steiner trees
inferredcites →https://doi.org/10.1016/s0377-2217(00)00143-0openalex-snapshot
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
inferredcites →https://doi.org/10.1017/cbo9781107359949.008openalex-snapshot
On the method of bounded differences
inferredcites →https://doi.org/10.1023/a:1018967121276openalex-snapshot
The Steiner tree problem with hop constraints
inferredcites →https://doi.org/10.1109/infcom.1993.253399openalex-snapshot
Multicasting in a linear lightwave network
inferredcites →https://doi.org/10.1109/infcom.2000.832232openalex-snapshot
On the construction of energy-efficient broadcast and multicast trees in wireless networks
inferredcites →https://doi.org/10.1109/ipdps.2005.210openalex-snapshot
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks
inferredcites →https://doi.org/10.1109/vetecf.2004.1404638openalex-snapshot
Twelve reasons not to route over many short hops
inferredcites →https://doi.org/10.1111/j.1475-3995.1999.tb00176.xopenalex-snapshot
Approximating minimum spanning tree of depth 2
inferredcites →https://doi.org/10.1145/258533.258600openalex-snapshot
Approximation algorithms for facility location problems (extended abstract)
inferredcites →https://doi.org/10.1145/276698.276718openalex-snapshot
Approximation schemes for Euclidean k -medians and related problems
inferredcites →https://doi.org/10.1145/58564.59295openalex-snapshot
A tree-based algorithm for distributed mutual exclusion
inferredcites →https://doi.org/10.1145/952532.952678openalex-snapshot
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem
inferredcites →https://doi.org/10.1287/ijoc.4.2.192openalex-snapshot
Using a Hop-Constrained Model to Generate Alternative Communication Network Design
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.4132050openalex-extracted
A Ptas for K-Hop Mst on the Euclidean Plane: Improving Dependency on K
inferred← citeshttps://doi.org/10.1007/11814764_7openalex-snapshot
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-68845-9_3openalex-snapshot
Error Exponents for Decentralized Detection in Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77871-4_8openalex-snapshot
Analysis of the Bounded-Hops Converge-Cast Distributed Protocol in Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14785-2_4openalex-snapshot
On Alarm Protocol in Wireless Sensor Networks
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/dcc.2007.16openalex-snapshot
Bayesian Detection in Bounded Height Tree Networks
inferred← citeshttps://doi.org/10.1109/tsp.2009.2023374openalex-snapshot
Bayesian Detection in Bounded Height Tree Networks
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.