Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Manjanna Basappa"'
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783031252105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fe40e607e88d460ad705fbd71a79b0b
https://doi.org/10.1007/978-3-031-25211-2_5
https://doi.org/10.1007/978-3-031-25211-2_5
Autor:
Manjanna Basappa
Publikováno v:
Discrete Applied Mathematics. 305:261-271
In this paper, we consider the following variations of Line Segment Disk Cover (LSDC) problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f7ef6b21576348538a37a9bcb18d297
https://doi.org/10.1016/j.dam.2021.04.019
https://doi.org/10.1016/j.dam.2021.04.019
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
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
Publikováno v:
Computational Science and Its Applications – ICCSA 2021 ISBN: 9783030866525
ICCSA (1)
ICCSA (1)
We consider the k-Colorable Discrete Unit Disk Cover (k-CDUDC) problem as follows. Given a parameter k, a set P of n points, and a set D of m unit disks, both sets lying in the plane, the objective is to compute a set \(D'\subseteq D\) such that ever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8b3950e1afb08d0f8965e021675ccc2
https://doi.org/10.1007/978-3-030-86653-2_30
https://doi.org/10.1007/978-3-030-86653-2_30
Autor:
Manjanna Basappa, Sudeepta Mishra
Publikováno v:
Distributed Computing and Internet Technology ISBN: 9783030656201
ICDCIT
ICDCIT
In a wireless network using directional transmitters, a typical problem is to schedule a set of directional links to cover all the receivers in a region, such that an adequate data rate and coverage are maintained while minimizing interference. We ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92ddf07039010511d4ad9666815b6860
https://doi.org/10.1007/978-3-030-65621-8_7
https://doi.org/10.1007/978-3-030-65621-8_7
Autor:
Manjanna Basappa
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783319741796
CALDAM
CALDAM
In this paper, we consider the following variations of Line Segment Disk Cover (LSDC) problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc12cdf0e0a48bfd7de22c92f999f0a0
https://doi.org/10.1007/978-3-319-74180-2_7
https://doi.org/10.1007/978-3-319-74180-2_7
Publikováno v:
Journal of Discrete Algorithms. 33:193-201
In this paper we consider the discrete unit disk cover problem and the rectangular region cover problem as follows:(i) Given a set P of points and a set D of unit disks in the plane such that ? d ? D d covers all the points in P , select minimum card
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b73e7d19c1ec091f290630644aaeac6a
https://doi.org/10.1016/j.jda.2015.05.002
https://doi.org/10.1016/j.jda.2015.05.002
Publikováno v:
Algorithms for Sensor Systems ISBN: 9783319530574
ALGOSENSORS
ALGOSENSORS
In this paper, we consider k-supplier problem in Open image in new window . Here, two sets of points \(\mathcal{P}\) and \(\mathcal{Q}\) are given. The objective is to choose a subset \(Q_{opt} \subseteq \mathcal{Q}\) of size at most k such that cong
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f21e7894527bc78d53563c339ab11fa0
https://doi.org/10.1007/978-3-319-53058-1_9
https://doi.org/10.1007/978-3-319-53058-1_9
Autor:
Manjanna Basappa, Gautam K. Das
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 10:1850072
In this paper, we consider the discrete unit square cover (DUSC) problem as follows: given a set [Formula: see text] of [Formula: see text] points and a set [Formula: see text] of [Formula: see text] axis-aligned unit squares in [Formula: see text],
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79fb3b6ee3fafdd1e8f245ec4a0d0836
https://doi.org/10.1142/s1793830918500726
https://doi.org/10.1142/s1793830918500726