Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Gautam K. Das"'
Publikováno v:
Operations Research Letters. 49:48-54
Here we propose a fixed-parameter tractable (FPT) algorithm for the k -supplier problem with n clients and m facilities in R 2 . The algorithm produces a ( 1 + ϵ ) -factor approximation result in O ( ( max { 8 ϵ − 2 , 1 } ) k ( n + m ) log ( m n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::928add38309d8b97db77c93696bff166
https://doi.org/10.1016/j.orl.2020.10.008
https://doi.org/10.1016/j.orl.2020.10.008
Autor:
Gautam K. Das, Ramesh K. Jallu
Publikováno v:
Discrete Applied Mathematics. 286:91-99
In this paper, we consider Euclidean versions of the 2-tuple dominating set problem and the liar’s dominating set problem. For a given set P = { p 1 , p 2 , … , p n } of n points in R 2 , the objective of the Euclidean 2-tuple dominating set prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd7595c967928bf8eac94fac3f537b65
https://doi.org/10.1016/j.dam.2020.01.017
https://doi.org/10.1016/j.dam.2020.01.017
Publikováno v:
Discrete Applied Mathematics. 285:242-251
Consider a capacitated covering problem as follows: let P = { p 1 , p 2 , … , p n } be a customers set of size n and Q = { q 1 , q 2 , … , q m } be a service centers set of size m . Assume that a service center can provide service to at most α (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::579a3400cd68b539957f8ca3fd5b5e47
https://doi.org/10.1016/j.dam.2020.05.025
https://doi.org/10.1016/j.dam.2020.05.025
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2018, ⟨10.1016/j.dam.2018.05.049⟩
Discrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2018.05.049⟩
Discrete Applied Mathematics, Elsevier, 2018, ⟨10.1016/j.dam.2018.05.049⟩
Discrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2018.05.049⟩
We consider the maximum (weight) independent set problem in unit disk graphs. The high complexity of the existing polynomial-time approximation schemes motivated the development of faster constant approximation algorithms. In this paper, we present a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e77dac517a9c99cfc91a181b0b078120
https://doi.org/10.1016/j.dam.2018.05.049
https://doi.org/10.1016/j.dam.2018.05.049
Publikováno v:
International Journal of Foundations of Computer Science. 31:275-291
In this paper, we consider a restricted covering problem, in which a convex polygon [Formula: see text] with [Formula: see text] vertices and an integer [Formula: see text] are given, the objective is to cover the entire region of [Formula: see text]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::110dfa69b793f22d65347f28fe5a4536
https://doi.org/10.1142/s0129054120500070
https://doi.org/10.1142/s0129054120500070
In this article, we study the d-distance m-tuple ( l , r )-domination problem. Given a simple undirected graph G = ( V , E ) , and positive integers d , m , l and r, a subset V ′ ⊆ V is said to be a d-distance m-tuple ( l , r )-dominating set if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::702d53b50f13be71cbc4f14e186663dc
Publikováno v:
Journal of Parallel and Distributed Computing. 104:159-166
Let G=(V,E) be a unit disk graph corresponding to a given set P of n points in R2. We propose a distributed approximation algorithm to find a minimum connected dominating set of G. The maintenance of the connected dominating set constructed is fully
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd0378ef130b51b82a8eede4019d2afd
https://doi.org/10.1016/j.jpdc.2017.01.023
https://doi.org/10.1016/j.jpdc.2017.01.023
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030105631
WALCOM
WALCOM
Consider a capacitated version of the discrete unit disk cover problem as follows: consider a set \(P= \{p_1,p_2, \cdots ,p_n\}\) of n customers and a set \(Q=\{q_1,q_2, \cdots ,q_m\}\) of m service centers. A service center can provide service to at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72bc965d57b539682b78b42e5f7d02be
https://doi.org/10.1007/978-3-030-10564-8_32
https://doi.org/10.1007/978-3-030-10564-8_32
This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019. The 30 full papers presented were carefully reviewed and selected fr
Publikováno v:
Frontiers in Algorithmics ISBN: 9783319784540
FAW
FAW
In this article, we study the maximum distance-d independent set problem, a variant of the maximum independent set problem, on unit disk graphs. We first show that the problem is NP-hard. Next, we propose a polynomial-time constant-factor approximati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc4dbc50c2a0771bd6bac976bc753c8e
https://doi.org/10.1007/978-3-319-78455-7_6
https://doi.org/10.1007/978-3-319-78455-7_6