Search

Your search keyword '"Sen, Arunabha"' showing total 6 results
Start Over Author "Sen, Arunabha" Topic approximation algorithm
6 results on '"Sen, Arunabha"'

2. Terrorist Network Monitoring with Identifying Code

Author

Sen, Arunabha, Goliber, Victoria Horan, Zhou, Chenyang, Basu, Kaustav, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Thomson, Robert, editor, Dancy, Christopher, editor, Hyder, Ayaz, editor, and Bisgin, Halil, editor

Published
2018
Full Text
View/download PDF

3. Fault-Tolerant Design of Wireless Sensor Networks with Directional Antennas

Author

Shirazipourazad, Shahrzad, Sen, Arunabha, Bandyopadhyay, Subir, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Frey, Davide, editor, Raynal, Michel, editor, Sarkar, Saswati, editor, Shyamasundar, Rudrapatna K., editor, and Sinha, Prasun, editor

Published
2013
Full Text
View/download PDF

4. Discriminating Codes in Geometric Setups

Author

Dey, Sanjana, Foucaud, Florent, Nandy, Subhas C, Sen, Arunabha, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Université d'Orléans (UO)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)

Subjects
Discriminating code, Segment stabbing, Geometric Hitting set, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], Approximation algorithm, Theory of computation → Approximation algorithms analysis
Abstract

We study two geometric variations of the discriminating code problem. In the discrete version, a finite set of points P and a finite set of objects S are given in ℝ^d. The objective is to choose a subset S^* ⊆ S of minimum cardinality such that the subsets S_i^* ⊆ S^* covering p_i, satisfy S_i^* ≠ ∅ for each i = 1,2,…, n, and S_i^* ≠ S_j^* for each pair (i,j), i ≠ j. In the continuous version, the solution set S^* can be chosen freely among a (potentially infinite) class of allowed geometric objects. In the 1-dimensional case (d = 1), the points are placed on some fixed-line L, and the objects in S are finite segments of L (called intervals). We show that the discrete version of this problem is NP-complete. This is somewhat surprising as the continuous version is known to be polynomial-time solvable. This is also in contrast with most geometric covering problems, which are usually polynomial-time solvable in 1D. We then design a polynomial-time 2-approximation algorithm for the 1-dimensional discrete case. We also design a PTAS for both discrete and continuous cases when the intervals are all required to have the same length. We then study the 2-dimensional case (d = 2) for axis-parallel unit square objects. We show that both continuous and discrete versions are NP-hard, and design polynomial-time approximation algorithms with factors 4+ε and 32+ε, respectively (for every fixed ε > 0)., LIPIcs, Vol. 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020), pages 24:1-24:16

Published
2020

5. Budgeted Competitive Influence Maximization on Online Social Networks

Author

Pham, Canh V., Duong, Hieu V., Bui, Bao Q., Thai, My T., Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Chen, Xuemin, editor, Sen, Arunabha, editor, Li, Wei Wayne, editor, and Thai, My T., editor

Published
2018
Full Text
View/download PDF

6. Revisiting of ‘Revisiting the Stop-and-Stare Algorithms for Influence Maximization’

Author

Nguyen, Hung T., Dinh, Thang N., Thai, My T., Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Chen, Xuemin, editor, Sen, Arunabha, editor, Li, Wei Wayne, editor, and Thai, My T., editor

Published
2018
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results