Approximation for the minimum cost doubly resolving set problem
type: Item
instance of: scholarly article
title: Approximation for the minimum cost doubly resolving set problem
zbMATH Open document ID: 1332.05131
author: Xiaodong Hu
author: Changjun Wang
author: Xujin Chen
published in: Theoretical Computer Science
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6520540
zbMATH Keywords: source location
zbMATH Keywords: doubly resolving set
zbMATH Keywords: approximation algorithms
zbMATH Keywords: polynomial-time solvability
zbMATH Keywords: metric dimension
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.03.048
OpenAlex ID: W2058873618
cites work: Tight approximability results for test set problems in bioinformatics
cites work: On the Metric Dimension of Cartesian Products of Graphs
cites work: Minimal doubly resolving sets of prism graphs
cites work: Q4464781
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: On the Complexity of Metric Dimension
cites work: Design and analysis of approximation algorithms
cites work: The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
cites work: Approximation complexity of metric dimension problem
cites work: Optimizing over Consecutive 1's and Circular 1's Constraints
cites work: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
cites work: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
cites work: Computing minimal doubly resolving sets of graphs
cites work: Variable neighborhood search for metric dimension and minimal doubly resolving set problems
cites work: On Metric Generators of Graphs
cites work: Rumors in a Network: Who's the Culprit?
DOI: 10.1016/J.TCS.2015.03.048
description: scientific article; zbMATH DE number 6520540