Some Related Problems from Network Flows, Game Theory and        Integer Programming

Sahni, Sartaj

Some Related Problems from Network Flows, Game Theory and Integer Programming

File(s)

72-132.ps (416.9 KB)

72-132.pdf (1.44 MB)

Permanent Link(s)

https://hdl.handle.net/1813/5987

Collections

Computer Science Technical Reports

Author

Sahni, Sartaj

Abstract

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 algorrithm for the others.

Date Issued

1972-07

Publisher

Cornell University

Keywords

computer science

•

technical report

Previously Published as

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR72-132

Type

technical report