Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
mikleb
on Oct 26, 2010
|
parent
|
context
|
favorite
| on:
What algorithm blows your mind? (Reddit compsci)
But maximal matroid matching is NP-hard. ;)
Approximating the minimum spaning tree weight in subliner time is very unexpected algorithm.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Approximating the minimum spaning tree weight in subliner time is very unexpected algorithm.