On the public citation graph

Improved Approximation Algorithms for Relay Placement

https://doi.org/10.1145/2814938
0 signed · 48 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/11533719_25openalex-snapshot
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/11775096_23openalex-snapshot
Connected Set Cover Problem and Its Applications
inferredcites →https://doi.org/10.1007/3-540-48523-6_17openalex-snapshot
On Some Tighter Inapproximability Results (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-540-72870-2_29openalex-snapshot
Minimum Spanning Tree with Neighborhoods
inferredcites →https://doi.org/10.1007/978-3-540-77120-3_56openalex-snapshot
Covering Points by Unit Disks of Fixed Location
inferredcites →https://doi.org/10.1007/978-3-540-77974-2openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-540-87744-8_30openalex-snapshot
Improved Approximation Algorithms for Relay Placement
inferredcites →https://doi.org/10.1007/bf01758755openalex-snapshot
A proof of the Gilbert-Pollak conjecture on the Steiner ratio
inferredcites →https://doi.org/10.1007/bf02837777openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/s00453-011-9508-3openalex-snapshot
The Steiner Ratio Gilbert–Pollak Conjecture Is Still Open
inferredcites →https://doi.org/10.1007/s10878-005-5482-5openalex-snapshot
Requiring Connectivity in the Set Covering Problem
inferredcites →https://doi.org/10.1007/s10878-006-7140-yopenalex-snapshot
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
inferredcites →https://doi.org/10.1007/s11276-006-0724-8openalex-snapshot
Relay sensor placement in wireless sensor networks
inferredcites →https://doi.org/10.1016/j.comcom.2004.12.032openalex-snapshot
Relay node placement in large scale wireless sensor networks
inferredcites →https://doi.org/10.1016/s0020-0190(00)00095-8openalex-snapshot
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
inferredcites →https://doi.org/10.1016/s0020-0190(98)00201-4openalex-snapshot
Steiner tree problem with minimum number of Steiner points and bounded edge-length
inferredcites →https://doi.org/10.1016/s0304-3975(00)00182-1openalex-snapshot
Approximations for Steiner trees with minimum number of Steiner points
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1023/a:1008384012064openalex-snapshot
Approximations for Steiner Trees with Minimum Number of Steiner Points
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/fscs.1990.89526openalex-snapshot
An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio
inferredcites →https://doi.org/10.1109/hpsr.2004.1303479openalex-snapshot
Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation
inferredcites →https://doi.org/10.1109/infcom.2007.193openalex-snapshot
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
inferredcites →https://doi.org/10.1109/infocom.2008.65openalex-snapshot
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements
inferredcites →https://doi.org/10.1109/tc.2007.18openalex-snapshot
Relay Node Placement in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tc.2007.250629openalex-snapshot
Relay Node Placement in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tnet.2009.2024941openalex-snapshot
Deploying Sensor Networks With Guaranteed Fault Tolerance
inferredcites →https://doi.org/10.1111/j.1749-6632.1985.tb14564.xopenalex-snapshot
A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES
inferredcites →https://doi.org/10.1137/s0097539796309764openalex-snapshot
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k -MST, and Related Problems
inferredcites →https://doi.org/10.1145/1062689.1062729openalex-snapshot
Deploying sensor networks with guaranteed capacity and fault tolerance
inferredcites →https://doi.org/10.1145/1132905.1132924openalex-snapshot
Mobile backbone networks --
inferredcites →https://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferredcites →https://doi.org/10.1145/2455.214106openalex-snapshot
Approximation schemes for covering and packing problems in image processing and VLSI
inferredcites →https://doi.org/10.1145/258533.258599openalex-snapshot
Approximation of k -set cover by semi-local optimization
inferredcites →https://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

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-030-11072-7_21openalex-snapshot
Geometric Aspects of Robot Navigation: From Individual Robots to Massive Particle Swarms
inferred← citeshttps://doi.org/10.1007/s10878-014-9823-0openalex-snapshot
Improved approximation algorithms for single-tiered relay placement
inferred← citeshttps://doi.org/10.1007/s11277-019-06925-7openalex-snapshot
Optimized Node Deployment in Wireless Sensor Network for Smart Grid Application
inferred← citeshttps://doi.org/10.1109/access.2020.3008289openalex-snapshot
Learning-Based IoT Data Aggregation for Disaster Scenarios
inferred← citeshttps://doi.org/10.1109/case58245.2025.11163892openalex-snapshot
An Improved Algorithm to Select Homotopy Candidates for the Constrained Optimization of Minimum-Power Networks
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683329openalex-snapshot
Relay Station Placement for Cooperative Communications in WiMAX Networks
inferred← citeshttps://doi.org/10.1109/jsen.2015.2456931openalex-snapshot
A Connectivity-Aware Approximation Algorithm for Relay Node Placement in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/sege.2013.6707901openalex-snapshot
Improved relay node placement algorithm for Wireless Sensor Networks application in Wind Farm
inferred← citeshttps://doi.org/10.1109/tmc.2011.126openalex-snapshot
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations
inferred← citeshttps://doi.org/10.1109/tnet.2020.2974923openalex-snapshot
Placement of Unmanned Aerial Vehicles for Directional Coverage in 3D Space
inferred← citeshttps://doi.org/10.1109/wcnc.2017.7925497openalex-snapshot
Relay Node Position Optimization in Complex Environment
inferred← citeshttps://doi.org/10.3390/s17102299openalex-snapshot
A Straight Skeleton Based Connectivity Restoration Strategy in the Presence of Obstacles for WSNs
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.