BOOSTING DATA REDUCTION FOR THE MAXIMUM WEIGHT INDEPENDENT SET PROBLEM USING INCREASING TRANSFORMATIONS

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM Symposium on Algorithm Engineering and Experiments (2021 : Online) Symposium on Algorithm Engineering and Experiments (ALENEX21)
1. Verfasser:	Gellner, Alexander (VerfasserIn)
Weitere Verfasser:	Lamm, Sebastian (VerfasserIn), Schulz, Christian (VerfasserIn), Strash, Darren (VerfasserIn), Zaválnij, Bogdán (VerfasserIn)
Pages:	21
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
A “LEARNED” APPROACH TO QUICKEN AND COMPRESS RANK/SELECT DICTIONARIES	2021	Boffa, Antonio
SAT-AND-REDUCE FOR VERTEX COVER: ACCELERATING BRANCH-AND-REDUCE BY SAT SOLVING	2021	Plachetta, Rick
ENGINEERING A FAST PROBABILISTIC ISOMORPHISM TEST	2021	Anders, Markus
BOOSTING DATA REDUCTION FOR THE MAXIMUM WEIGHT INDEPENDENT SET PROBLEM USING INCREASING TRANSFORMATIONS	2021	Gellner, Alexander
STREAMING SET COVER IN PRACTICE	2021	Barlow, Michael
MULTILEVEL ACYCLIC HYPERGRAPH PARTITIONING	2021	Popp, Merten
SCALABLE SHARED-MEMORY HYPERGRAPH PARTITIONING	2021	Gottesbüren, Lars
AN EXPERIMENTAL STUDY OF ALGORITHMS FOR COMPUTING THE EDGE CONNECTIVITY OF A DIRECTED GRAPH	2021	Georgiadis, Loukas
FAST, EXACT AND SCALABLE DYNAMIC RIDESHARING	2021	Buchhold, Valentin
GROUP-HARMONIC AND GROUP-CLOSENESS MAXIMIZATION — APPROXIMATION AND ENGINEERING	2021	Angriman, Eugenio
COMPUTATION OF LARGE ASYMPTOTICS OF 3-MANIFOLD QUANTUM INVARIANTS	2021	Maria, Clément
A PARALLEL PACKED MEMORY ARRAY TO STORE DYNAMIC GRAPHS	2021	Wheatman, Brian
PFP COMPRESSED SUFFIX TREES	2021	Boucher, Christina
ENGINEERING DATA REDUCTION FOR NESTED DISSECTION	2021	Ost, Wolfgang
FULLY DYNAMIC K-CENTER CLUSTERING IN LOW DIMENSIONAL METRICS	2021	Goranci, Gramoz
FAST MINIMAL PRESENTATIONS OF BI-GRADED PERSISTENCE MODULES	2021	Kerber, Michael