The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is <i>maximum clique</i>, which—under standard assumptions in complexity theory—cannot be solved in sub-exponential time or be approximated within the polynomi...
Sparad:
| Huvudupphov: | , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
MDPI AG
2021-08-01
|
| Serie: | Algorithms |
| Ämnen: | |
| Länkar: | https://www.mdpi.com/1999-4893/14/9/253 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|