Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Roy, Bodhayan"'
In this research, we examine the minsum flow problem in dynamic path networks where flows are represented as discrete and weighted sets. The minsum flow problem has been widely studied for its relevance in finding evacuation routes during emergencies
Externí odkaz:
http://arxiv.org/abs/2407.02177
We examine the dynamic network flow problem under the assumption that the flow consists of discrete units. The dynamic network flow problem is commonly addressed in the context of developing evacuation plans, where the flow is typically treated as a
Externí odkaz:
http://arxiv.org/abs/2404.16329
Autor:
Banik, Aritra, Das, Sayani, Maheshwari, Anil, Manna, Bubai, Nandy, Subhas C, M, Krishna Priya K, Roy, Bodhayan, Roy, Sasanka, Sahu, Abhishek
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph $G=(V,E)$, consisting of a vertex set $V$ of size $n$ and an edge set $E$. Each vertex in $V$ is assigned a color from the set $\{1,2,\ldots, c\
Externí odkaz:
http://arxiv.org/abs/2404.15487
We study the problem of allocating indivisible items on a path among agents. The objective is to find a fair and efficient allocation in which each agent's bundle forms a contiguous block on the line. We demonstrate that, even when the valuations are
Externí odkaz:
http://arxiv.org/abs/2401.04318
Autor:
Manna, Bubai, Roy, Bodhayan
For a graph G = (V,E) where each vertex is coloured by one of k colours, consider a subset C of V such that for each vertex v in V\C, its set of nearest neighbours in C contains at least one vertex of the same colour as v. Such a C is called a consis
Externí odkaz:
http://arxiv.org/abs/2303.02337
Autor:
Barsukov, Alexey, Roy, Bodhayan
An interval graph has interval count $\ell$ if it has an interval model, where among every $\ell+1$ intervals there are two that have the same length. Maximum Cut on interval graphs has been found to be NP-complete recently by Adhikary et al. while d
Externí odkaz:
http://arxiv.org/abs/2203.06630
Given a simple polygon $\cal P$, in the Art Gallery problem, the goal is to find the minimum number of guards needed to cover the entire $\cal P$, where a guard is a point and can see another point $q$ when $\overline{pq}$ does not cross the edges of
Externí odkaz:
http://arxiv.org/abs/2108.10940
Publikováno v:
In European Journal of Combinatorics March 2024 117
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon $\cal P$, first,
Externí odkaz:
http://arxiv.org/abs/2011.03107
Autor:
Chakraborty, Dibyayan, Das, Sandip, Foucaud, Florent, Gahlawat, Harmender, Lajou, Dimitri, Roy, Bodhayan
We study the complexity of finding the \emph{geodetic number} on subclasses of planar graphs and chordal graphs. A set $S$ of vertices of a graph $G$ is a \emph{geodetic set} if every vertex of $G$ lies in a shortest path between some pair of vertice
Externí odkaz:
http://arxiv.org/abs/2006.16511