Probability-boosting technique for combinatorial optimization
In many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items. In the worst case a deterministic algorithm must scan n−k items in the set to verify the k items. If we pick a set of k it...
| Yazar: | |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
PeerJ Inc.
2024-11-01
|
| Seri Bilgileri: | PeerJ Computer Science |
| Konular: | |
| Online Erişim: | https://peerj.com/articles/cs-2499.pdf |