4 citations · 6 across the 3 of their papers we have counts for
5 papers
A flow-based ascending auction to compute buyer-optimal Walrasian prices
Katharina Eickhoff, S. Thomas McCormick, Britta Peis +2
We consider a market where a set of objects is sold to a set of buyers, each equipped with a valuation function for the objects. The goal of the auctioneer is to determine reasonab…
Complexity of Source-Sink Monotone 2-Parameter Min Cut
Maxwell Allman, Venus Lo, S. Thomas McCormick
There are many applications of max flow with capacities that depend on one or more parameters. Many of these applications fall into the "Source-Sink Monotone" framework, a special…
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
S. Thomas McCormick, Britta Peis, Robert Scheidweiler +1
In this note we give a polynomial time algorithm for solving the closest vector problem in the class of zonotopal lattices. The Voronoi cell of a zonotopal lattice is a zonotope, i…
Faster Algorithms for Parametric Global Minimum Cut Problems
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
The parametric global minimum cut problem concerns a graph where the cost of each edge is an affine function of a parameter for some fixed dimension…
Protection of flows under targeted attacks
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo +2
Due to the importance of robustness in many real-world optimization problems, the field of robust optimization has gained a lot of attention over the past decade. We concentrate on…