activity
20112017
most citedOn Metric Multi-Covering Problems

4 citations · 6 across the 5 of their papers we have counts for

collaborators

6 papers

cs.DS2017

Capacitated Covering Problems in Geometric Spaces

Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar +1

In this article, we consider the following capacitated covering problem. We are given a set of points and a set of balls from some metric space, and a positiv…

cs.CG2016★ 4 cited

On Metric Multi-Covering Problems

Santanu Bhowmick, Tanmay Inamdar, Kasturi Varadarajan

In the metric multi-cover problem (MMC), we are given two point sets (servers) and (clients) in an arbitrary metric space , a positive integer that repre…

cs.CG2015

A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment

Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi Varadarajan

Given an initial placement of a set of rectangles in the plane, we consider the problem of finding a disjoint placement of the rectangles that minimizes the area of the bounding bo…

cs.CG2014★ 2 cited

A Constant-Factor Approximation for Multi-Covering with Disks

Santanu Bhowmick, Kasturi Varadarajan, Shi-Ke Xue

We consider variants of the following multi-covering problem with disks. We are given two point sets (servers) and (clients) in the plane, a coverage function $κ:X \rightar…

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…

cs.OH2011

Generation of Test Vectors for Sequential Cell Verification

Santanu Bhowmick, S. Bhattacherjee, Nandakumar G. N

For Application Specific Integrated Circuits (ASIC) and System-on-Chip (SOC) designs, Cell - Based Design (CBD) is the most prevalent practice as it guarantees a shorter design cyc…