Finding Near-Optimal Weight Independent Sets at Scale
Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data reduction techniques do not work well. To be more precise, state-of-the-art branch-and-reduce algorithms can solve many larg...
Uložené v:
| Vydané v: | Journal of graph algorithms and applications Ročník 28; číslo 1; s. 439 - 473 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
15.11.2024
|
| ISSN: | 1526-1719, 1526-1719 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!