activity
20182026
most citedPower domination polynomials of graphs

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

collaborators

5 papers

cs.DS2026

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General

David Shmoys, Varun Suriyanarayana, Seeun William Umboh

The Joint Replenishment Problem (JRP) is a classical inventory management problem, that aims to model the trade-off between coordinating orders for multiple commodities (and their…

cs.DS2023

Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints

Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi +1

The joint replenishment problem (JRP) is a classical inventory management problem. We consider a natural generalization with outliers, where we are allowed to reject (that is, not…

cs.DS2022

Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse

Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana

We consider the online unrelated-machine load balancing problem with recourse, where the algorithm is allowed to re-assign prior jobs. We give a -competitive algorithm for t…

math.OC2019

Theorems of the Alternative for Conic Integer Programming

Temitayo Ajayi, Varun Suriyanarayana, Andrew J. Schaefer

Farkas' Lemma is a foundational result in linear programming, with implications in duality, optimality conditions, and stochastic and bilevel programming. Its generalizations are k…

math.CO2018★ 1 cited

Power domination polynomials of graphs

Boris Brimkov, Rutvik Patel, Varun Suriyanarayana +1

A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from…