What is it about?

There are many important computational problems that can be solved by linear programming. This paper shows that an important algorithm for solving such problems - the ellipsoid method - can be implemented in a symmetry preserving way. In particular, this yields a symmetric algorithm for determining if a graph contains a perfect matching.

Featured Image

Read the Original

This page is a summary of: Solving Linear Programs without Breaking Abstractions, Journal of the ACM, December 2015, ACM (Association for Computing Machinery),
DOI: 10.1145/2822890.
You can read the full text:

Read

Contributors

The following have contributed to this page