40 citations · 60 across the 9 of their papers we have counts for
11 papers
Approximate Euclidean shortest paths in polygonal domains
R Inkulu, Sanjiv Kapoor
Given a set of pairwise disjoint simple polygonal obstacles in defined with vertices, we compute a sketch of whose size is in…
A Polynomial Time Algorithm to Compute an Approximate Weighted Shortest Path
R Inkulu, Sanjiv Kapoor
We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated reg…
Price of Anarchy with Heterogeneous Latency Functions
Sanjiv Kapoor, Junghwan Shin
In this paper we consider the price of anarchy (PoA) in multi-commodity flows where the latency or delay function on an edge has a heterogeneous dependency on the flow commodities,…
Approximating Quadratic 0-1 Programming via SOCP
Sanjiv Kapoor, Hemanshu Kaul
We consider the problem of approximating Quadratic O-1 Integer Programs with bounded number of constraints and non-negative constraint matrix entries, which we term as PIQP. We des…
Auction Algorithm for Production Models
Junghwan Shin, Sanjiv Kapoor
We show an auction-based algorithm to compute market equilibrium prices in a production model, where consumers purchase items under separable nonlinear utility concave functions wh…
Efficient Construction of Spanners in -Dimensions
Sanjiv Kapoor, XiangYang Li
In this paper we consider the problem of efficiently constructing -vertex fault-tolerant geometric -spanners in $\dspace$ (for and ). Vertex fault-tolerant sp…