October 1, 1972

Some related problems from network flows, game theory and integer programming

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

We consider several important problems for which no polynomially time bounded algorithm is known. These problems are shown to be related in that a polynomial algorithm for one implies a polynomial algorithm for the others.

Me gusta

Guardar

Cite This Study

Sartaj Sahni (Sun,) studied this question.

synapsesocial.com/papers/6a156eda5347fbb1739fc78b https://doi.org/https://doi.org/10.1109/swat.1972.23

Me gusta

Guardar