Simple heuristics for unit disk graphs-Reference-Cited by-同舟云学术

Simple heuristics for unit disk graphs

Published:1995-03 Issue:2 Volume:25 Page:59-68
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Marathe M. V.,Breu H.,Hunt H. B.,Ravi S. S.,Rosenkrantz D. J.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference31 articles.

1. , , , and , Proof verification and hardness of approximation problems. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS 1992), Pittsburgh, PA (Oct. 1992) 14–23.

2. Approximation algorithms for NP-complete problems on planar graphs. Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS 1983), Tucson, AZ (Nov. 1983) 265–273.

3. and , On approximating a vertex cover for planar graphs. Proceedings of the 14th Annual ACM Symposium on Theory of Computing (May 1982) 303–309.

4. and , A local ratio theorem for approximating the weighted vertex cover problem. Analysis and Design of Algorithms for Combinatorial Problems. Annals of Discrete Mathematics, Vol. 25 North-Holland, New York. (1985) 27–45.

Cited by 286 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Total (restrained) domination in unit disk graphs;Information and Computation;2024-10

2. Annulus Graphs in $$\mathbb R^d$$;Discrete & Computational Geometry;2024-05-16

3. Total Roman domination and total domination in unit disk graphs;COMMUN COMB OPTIM;2024

4. A Survey on Variant Domination Problems in Geometric Intersection Graphs;Parallel Processing Letters;2024-01-17

5. Semi-total Domination in Unit Disk Graphs;Lecture Notes in Computer Science;2024