10 citations · 33 across the 24 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014★ 8 cited
A Variant of the Maximum Weight Independent Set Problem
Sayan Bandyapadhyay
We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph …
cs.DS2014
Voronoi Game on Graphs
Sayan Bandyapadhyay, Aritra Banik, Sandip Das +1
\textit{Voronoi game} is a geometric model of competitive facility location problem played between two players. Users are generally modeled as points uniformly distributed on a giv…
cs.CG2014
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi Varadarajan
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-p…