Zobrazeno 1 - 10
of 468
pro vyhledávání: '"Gupta, Neelima"'
Clustering problems such as $k$-Median, and $k$-Means, are motivated from applications such as location planning, unsupervised learning among others. In such applications, it is important to find the clustering of points that is not ``skewed'' in ter
Externí odkaz:
http://arxiv.org/abs/2305.01471
Clustering is one of the most fundamental problem in Machine Learning. Researchers in the field often require a lower bound on the size of the clusters to maintain anonymity and upper bound for the ease of analysis. Specifying an optimal cluster size
Externí odkaz:
http://arxiv.org/abs/2203.14058
Autor:
Dabas, Rajni, Gupta, Neelima
In this paper, we study locating charging station problem as facility location problem and its variants ($k$-Median, $k$-Facility location and $k$-center). We study the connectivity and the capacity constraints in these problem. Capacity and connecti
Externí odkaz:
http://arxiv.org/abs/2202.06262
Autor:
Prasad, Pallavi1 pallavisgpgi@gmail.com, Gupta, Neelima1, Verma, Ritu1, Prasad, Narayan2, Kaul, Anupama2, Agrawal, Vinita1, Jain, Manoj1
Publikováno v:
Indian Journal of Nephrology. May/Jun2024, Vol. 34 Issue 3, p257-260. 4p.
Autor:
Rani, Majji Sai Sudha, Gopi, Priyanka, Yadav, Akankasha, Sharma, Palak, Singh, Shweta, Gupta, Neelima, Ali, Mohd Sajid, Pandya, Prateek
Publikováno v:
In Journal of Molecular Structure 5 November 2024 1315
Autor:
Dabas, Rajni, Gupta, Neelima
In this work, we study the extension of two variants of the facility location problem (FL) to make them robust towards a few distantly located clients. First, $k$-facility location problem ($k$FL), a common generalization of FL and $k$ median problem
Externí odkaz:
http://arxiv.org/abs/2107.00403
With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the availability and profitability of the central store. A store serving to
Externí odkaz:
http://arxiv.org/abs/2106.11372
Autor:
Dabas, Rajni, Gupta, Neelima
In this paper, we present a framework to design approximation algorithms for capacitated facility location problems with penalties/outliers using LP-rounding. Primal-dual technique, which has been particularly successful in dealing with outliers and
Externí odkaz:
http://arxiv.org/abs/2012.07135
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Sonam Dongsar, Tenzin, Tsering Dongsar, Tenzin, Molugulu, Nagashekhara, Annadurai, Sivakumar, Wahab, Shadma, Gupta, Neelima, Kesharwani, Prashant
Publikováno v:
In Environmental Research 15 September 2023 233