HN Simulator
new
|
past
|
comments
|
lists
|
submit
login
mjd
73 days ago
|
parent
|
context
|
favorite
| on:
NP-overrated
I was surprised that Gruhn didn't include this in his list of problems where the NP-hardness is not that important in practice.
I think the Ford-Fulkerson maximum flow algorithm may be another example.
JohnKemeny
73 days ago
[–]
Maximum flow isn't NP-hard, though. It can be solved in near-linear time.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
DMCA
|
Apply to YC
|
Contact
Search:
I think the Ford-Fulkerson maximum flow algorithm may be another example.