Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of Computing Maximum and Minimum Min-Cost-Flows."

Kai Hoppmann-Baum (2022)

> Home

Details and statistics

DOI: 10.1002/NET.22060

access: open

type: Journal Article

metadata version: 2022-05-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/networks/Hoppmann-Baum22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Hoppmann-Baum22
Kai Hoppmann-Baum:
On the Complexity of Computing Maximum and Minimum Min-Cost-Flows. Networks 79(2): 236-248 (2022)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.