Approximating the Minimum-cost Maximum Flow is P-Complete
We show that it is impossible, in NC, to approximate the value of the minimum-cost maximum flow unless P = NC.
| Autors principals: | , |
|---|---|
| Publicat: |
2023
|
| Accés en línia: | https://hdl.handle.net/1721.1/149197 |
| Sumari: | We show that it is impossible, in NC, to approximate the value of the minimum-cost maximum flow unless P = NC. |
|---|