3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.SI2023★ 1 cited
Solving the Identifying Code Set Problem with Grouped Independent Support
Anna L. D. Latour, Arunabha Sen, Kuldeep S. Meel
An important problem in network science is finding an optimal placement of sensors in nodes in order to uniquely detect failures in the network. This problem can be modelled as an…
cs.CG2020★ 3 cited
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
Sanjana Dey, Florent Foucaud, Subhas C Nandy +1
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points and a finite set of objects are give…