On the public citation graph
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks
0 signed · 37 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/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
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-48777-8_8openalex-snapshot
Improved Approximation Algorithms for Capacitated Facility Location Problems
inferredcites →https://doi.org/10.1007/978-1-4613-1353-3openalex-snapshot
Wireless Information Networks
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_5openalex-snapshot
A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
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)00103-1openalex-snapshot
An 0.828-approximation algorithm for the uncapacitated facility location problem
inferredcites →https://doi.org/10.1016/s0304-3975(98)00223-0openalex-snapshot
Power consumption in packet radio networks
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.1016/s0969-6016(99)00018-0openalex-snapshot
Approximating minimum spanning tree of depth 2
inferredcites →https://doi.org/10.1023/b:mone.0000013624.32948.87openalex-snapshot
On the Power Assignment Problem in Radio Networks
inferredcites →https://doi.org/10.1080/00207160211289openalex-snapshot
Random-tree Diameter and the Diameter-constrained MST
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
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/vetecf.2004.1404638openalex-snapshot
Twelve reasons not to route over many short hops
inferredcites →https://doi.org/10.1137/0222055openalex-snapshot
Multiple Communication in Multihop Radio Networks
inferredcites →https://doi.org/10.1137/s0097539703405754openalex-snapshot
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
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/72981.73005openalex-snapshot
Multiple communication in multi-hop radio networks
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.1145/952670.952678openalex-snapshot
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem
inferredcites →https://doi.org/10.2307/2033241openalex-snapshot
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11429647_9openalex-snapshot
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
inferred← citeshttps://doi.org/10.1007/11775096_32openalex-snapshot
Weighted Broadcast in Linear Radio Networks
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-3-031-54534-4_24openalex-snapshot
The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph
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.1016/j.tcs.2007.04.039openalex-snapshot
On the bounded-hop MST problem on random Euclidean instances
inferred← citeshttps://doi.org/10.1111/poms.12521openalex-snapshot
Design Improvements for Message Propagation in Malleable Social Networks
inferred← citeshttps://doi.org/10.1134/s0005117923070068openalex-snapshot
On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter
inferred← citeshttps://doi.org/10.1142/9789812836243_0010openalex-snapshot
Range Assignment Problem in Wireless Network
inferred← citeshttps://doi.org/10.1145/1143997.1144185openalex-snapshot
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
inferred← citeshttps://doi.org/10.31857/s0005231023070085openalex-snapshot
On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter
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.