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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
MDPI AG
2021-08-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/14/9/253 |
| Tags: |
No Tags, Be the first to tag this record!
|