Simple heuristics for unit disk graphs
- 1 March 1995
- Vol. 25 (2), 59-68
- https://doi.org/10.1002/net.3230250205
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A polynomial time approximation algorithm for dynamic storage allocationDiscrete Mathematics, 1991
- On approximating the minimum independent dominating setInformation Processing Letters, 1991
- Unit disk graphsDiscrete Mathematics, 1990
- A study on two geometric location problemsInformation Processing Letters, 1988
- On‐line and first fit colorings of graphsJournal of Graph Theory, 1988
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- Outage Probability in Mobile Telephony with Directive Antennas and MacrodiversityIEEE Journal on Selected Areas in Communications, 1984
- Efficient bounds for the stable set, vertex cover and set packing problemsDiscrete Applied Mathematics, 1983
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974