M. Pittu

collaborators

4 papers

cs.DS2026

Combinatorial Optimization using Comparison Oracles

Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta +7

In linear combinatorial optimization, we aim to find $S^{*} = ar g min_{S \in F} ⟨ w, 1_{S} ⟩$ for a family $F \subseteq 2^{U}$ over a ground set…

cs.DM2025

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality

Aditi Laddha, Madhusudhan Reddy Pittu

Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of…

cs.DS2025

Max-Cut with Multiple Cardinality Constraints

Yury Makarychev, Madhusudhan Reddy Pittu, Ali Vakilian

We study the classic Max-Cut problem under multiple cardinality constraints, which we refer to as the Constrained Max-Cut problem. Given a graph $G = (V, E)$ , a partition of the vert…

cs.DS2025

Guessing Efficiently for Constrained Subspace Approximation

Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu +2

In this paper we study constrained subspace approximation problem. Given a set of $n$ points ${a_{1}, \dots, a_{n}}$ in $R^{d}$ , the goal of the {\em subspace approximation} pr…