Approximability of identifying codes and locating--dominating codes

Authors:
Jukka Suomela
Affiliations:
Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki, P.O. Box 68, FI-00014 University of Helsinki, Finland
Venue:
Information Processing Letters
Year:
2007

Citing 11
Cited 3

Domination and location in acyclic graphs

Networks
Landmarks in graphs

Discrete Applied Mathematics
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
On Syntactic versus Computational Views of Approximability

SIAM Journal on Computing
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Alarm placement in systems with fault propagation

Theoretical Computer Science
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

Theoretical Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Networking Wireless Sensors

Networking Wireless Sensors
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory

Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs

ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Local approximation algorithms for scheduling problems in sensor networks

ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Network verification via routing table queries

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible to approximate both problems within a logarithmic factor, but sublogarithmic approximation ratios are intractable. In bounded-degree graphs, there is a trivial constant-factor approximation algorithm, but arbitrarily low approximation ratios remain intractable. In so-called local graphs, there is a polynomial-time approximation scheme. We also consider fractional packing of codes and a related problem of finding minimum-weight codes.