On the public citation graph

An Approximation Algorithm for the Wireless Gathering Problem

0 signed · 27 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/978-1-4613-1353-3openalex-snapshot
Wireless Information Networks
inferredcites →https://doi.org/10.1016/0022-0000(92)90042-hopenalex-snapshot
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
inferredcites →https://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferredcites →https://doi.org/10.1017/cbo9780511807213openalex-snapshot
Fundamentals of Wireless Communication
inferredcites →https://doi.org/10.1109/12.238484openalex-snapshot
Scattering and gathering messages in networks of processors
inferredcites →https://doi.org/10.1137/0222055openalex-snapshot
Multiple Communication in Multihop Radio Networks
inferredcites →https://doi.org/10.1142/s0129626406002551openalex-snapshot
HARDNESS AND APPROXIMATION OF GATHERING IN STATIC RADIO NETWORKS
inferredcites →https://doi.org/10.1201/9780203489635openalex-snapshot
Handbook of Sensor Networks
inferredcites →https://doi.org/10.5860/choice.42-3446openalex-snapshot
Handbook of sensor networks: compact wireless and wired sensing systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_9openalex-snapshot
The Distributed Wireless Gathering Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_22openalex-snapshot
Gathering with Minimum Delay in Tree Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_2openalex-snapshot
Time Optimal Gathering in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-85209-4_16openalex-snapshot
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
inferred← citeshttps://doi.org/10.1007/978-3-540-92862-1_3openalex-snapshot
Minimizing Average Flow Time in Sensor Data Gathering
inferred← citeshttps://doi.org/10.1007/978-3-540-92862-1_5openalex-snapshot
Efficient Scheduling of Data-Harvesting Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-00945-7_11openalex-snapshot
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_46openalex-snapshot
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.03.002openalex-snapshot
Framework for optimizing the capacity of wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.015openalex-snapshot
Collision-free path coloring with application to minimum-delay gathering in sensor networks
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.037openalex-snapshot
Optimal gathering protocols on paths under interference constraints
inferred← citeshttps://doi.org/10.1109/cits.2014.6878957openalex-snapshot
Minimum latency data collection in interference-aware Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icccs57501.2023.10150591openalex-snapshot
Data Collection Scheduling in Directional Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/iemcon.2018.8615099openalex-snapshot
Scheduling Problems in Wireless Sensor Networks and Internet of Things: A Comparative Overview
inferred← citeshttps://doi.org/10.1109/mobhoc.2009.5336958openalex-snapshot
Fast group communications in multihop wireless networks subject to physical interference
inferred← citeshttps://doi.org/10.1109/msn48538.2019.00042openalex-snapshot
Minimum-Latency Data Gathering Scheduling in Multi-Channel Wireless Sensor Networks Using Only Secure Links
inferred← citeshttps://doi.org/10.1145/1978782.1978788openalex-snapshot
Minimizing flow time in the wireless gathering problem
inferred← citeshttps://doi.org/10.4018/ijitn.2019040102openalex-snapshot
An Improved Data Collection Algorithm for Wireless Sensor 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.