Issues
- 0
Use KaHyPar's hypergraph DS
#22 opened by SebastianSchlag - 0
- 0
- 2
Compare JDP results with LPP results
#27 opened by SebastianSchlag - 0
- 0
Think about representations for E and S
#24 opened by SebastianSchlag - 0
- 0
Compare quality of naive vs clever splitting
#19 opened by adrianzap - 1
Erweiterung auf n Partitionen
#6 opened by poettig - 3
Initiale Lösung für KaHyPar
#7 opened by poettig - 1
- 1
Write NP-completeness proof formally
#21 opened by adrianzap - 1
- 0
- 1
Alternatividee von Sebastian prüfen
#8 opened by poettig - 0
Use a different, possible inexact, hypergraph formulation of the problem that can be more easily handled by Sebastian's framework.
#13 opened by lukashuebner - 0
Test in practice on empirical test datasets (let Benoit know if you need more) if it matters and how many of those dangling vertices will actually occur.
#12 opened by lukashuebner - 0
- 0
- 1
- 0
NP-complete Beweis für n CPUs
#3 opened by poettig - 1
Verfahren mit PaToH testen
#4 opened by poettig - 1
Sebastians Einwand überprüfen
#5 opened by poettig - 0
Split one partition naively
#17 opened by adrianzap - 2
Email Sabine prüfen
#14 opened by poettig - 0
Definition Team1 prüfen
#15 opened by poettig - 1
Upper Bound Sebastian
#16 opened by poettig - 0
Hypergraphrepräsentation
#1 opened by poettig - 0
Capacity Constraint Paper an Sebastian
#2 opened by poettig