Hans Raj Tiwary

activity

20082026

most citedExtended formulations for polygons

81 citations · 142 across the 18 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2014

Polynomial size linear programs for problems in P

David Avis, David Bremner, Hans Raj Tiwary +1

A perfect matching in an undirected graph $G = (V, E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$ . The perfect matching problem is to decide if $G$ ha…

cs.DM2011★ 81 cited

Extended formulations for polygons

Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary

The extension complexity of a polytope $P$ is the smallest integer $k$ such that $P$ is the projection of a polytope $Q$ with $k$ facets. We study the extension complexity of $n$ -g…

cs.DM2011★ 14 cited

Extended formulations, non-negative factorizations and randomized communication protocols

Yuri Faenza, Samuel Fiorini, Roland Grappe +1

An extended formulation of a polyhedron $P$ is a linear description of a polyhedron $Q$ together with a linear map $π$ such that $π (Q) = P$ . These objects are of fundamental importan…