Search Results for author: Debajyoti Kar

Found 3 papers, 0 papers with code

Sampling-Based Winner Prediction in District-Based Elections

no code implementations28 Feb 2022 Palash Dey, Debajyoti Kar, Swagato Sanyal

We complement this result by proving that any algorithm, from a natural class of algorithms, for predicting the winner in a district-based election when $r$ is plurality, must sample at least $\Omega\left(\frac{1}{\varepsilon^4}\log\frac{1}{\delta}\right)$ votes.

Approximation Algorithms for ROUND-UFP and ROUND-SAP

no code implementations7 Feb 2022 Debajyoti Kar, Arindam Khan, Andreas Wiese

In ROUND-UFP, the goal is to find a packing of all tasks into a minimum number of copies (rounds) of the given path such that for each copy, the total demand of tasks on any edge does not exceed the capacity of the respective edge.

Cannot find the paper you are looking for? You can Submit a new open access paper.