Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Chinmoy Dutta"'
Publikováno v:
Mathematics of Operations Research. 48:999-1016
Consider a matching problem, in which agents arrive to a marketplace over time and leave after some time periods. Agents can only be matched while present in the marketplace. Each pair of agents can yield a different match value, and a social planner
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::474524f5eeaf9a3dc2ee3cb806f7a6f3
https://doi.org/10.1287/moor.2022.1289
https://doi.org/10.1287/moor.2022.1289
Autor:
Amulya Kumar Gogoi, Jog Dev Mahanta, Raj Jyoti Deka, Saurabh Kumar Laskar, Chinmoy Dutta, Bitupon Dutta, B. N. Saikia
Publikováno v:
International Journal of Current Microbiology and Applied Sciences. 9:424-429
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51443003af3a7951eabe2d38abccf2c1
https://doi.org/10.20546/ijcmas.2020.910.052
https://doi.org/10.20546/ijcmas.2020.910.052
Publikováno v:
International Journal of Current Microbiology and Applied Sciences. 9:3932-3937
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a2aad857c058d389dfd53ffe6ad27ad
https://doi.org/10.20546/ijcmas.2020.907.461
https://doi.org/10.20546/ijcmas.2020.907.461
Publikováno v:
other univ website
EC
EC
Motivated by applications from ride-sharing and kidney exchange, we study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea90a9843aebe6fb856ff1de00a11d7c
https://hdl.handle.net/1721.1/129356
https://hdl.handle.net/1721.1/129356
Publikováno v:
SPAA
We study a distributed randomized information propagation mechanism in networks we call the coalescing-branching random walk (cobra walk, for short). A cobra walk is a generalization of the well-studied “standard” random walk, and is useful in mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8be017e747fe7a095940ef34e663fec
https://doi.org/10.1145/2486159.2486197
https://doi.org/10.1145/2486159.2486197
We study how to spread k tokens of information to every node on an n-node dynamic network, the edges of which are changing at each round. This basic gossip problem can be completed in O(n + k) rounds in any static network, and determining its complex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59cf7bf7b63b841ae51d49e6b877c5b0
http://hdl.handle.net/10220/25043
http://hdl.handle.net/10220/25043
Autor:
Srivathsan Srinivasagopalan, Costas Busch, Chinmoy Dutta, Rajmohan Rajaraman, Jaikumar Radhakrishnan
Publikováno v:
FOCS
We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\em stretch}, where the stretch of $T$ is defined to be the maximum ratio, over
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34f05b57466b87bc1c78437081d5be1c
https://doi.org/10.1109/focs.2012.45
https://doi.org/10.1109/focs.2012.45
Autor:
Jaikumar Radhakrishnan, Chinmoy Dutta
Publikováno v:
Algorithms and Computation ISBN: 9783642352607
ISAAC
ISAAC
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs whose union is a larger bipartite graph that has no large bipartite independent set. Our main result is a common generalization of two classical results in graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60bec2babf5a3c2d5d07416328d81205
https://doi.org/10.1007/978-3-642-35261-4_29
https://doi.org/10.1007/978-3-642-35261-4_29
Autor:
Jaikumar Radhakrishnan, Chinmoy Dutta
Publikováno v:
FOCS
We show a tight lower bound of Omega(N\log\log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a network of N randomly placed sensors, communicating using local tran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c73f881bee71093bd564006f28607385
https://doi.org/10.1109/focs.2008.72
https://doi.org/10.1109/focs.2008.72
Autor:
Chinmoy Dutta, Jaikumar Radhakrishnan
Publikováno v:
STACS 2006 ISBN: 9783540323013
STACS
STACS
An N-superconcentrator is a directed graph with N input vertices and N output vertices and some intermediate vertices, such that for k=1, 2, ..., N, between any set of k input vertices and any set of k output vertices, there are k vertex disjoint pat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0eadcfae05923c149a3926851a570ea
https://doi.org/10.1007/11672142_30
https://doi.org/10.1007/11672142_30