Fixed-parameter algorithms for DAG Partitioning

Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. (2009) as DAG Partitioning: given an arc-weighted directed acyclic graph on n vertices and m arcs, delete arcs with total weight at most k such that each resulting weakly-connected component con...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics 2017-03, Vol.220, p.134-160
Hauptverfasser:	van Bevern, René, Bredereck, Robert, Chopin, Morgan, Hartung, Sepp, Hüffner, Falk, Nichterlein, André, Suchý, Ondřej
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm engineering Algorithms Complement Computer simulation Data reduction Evaluating heuristics Graph algorithms Graph theory Graphs Heuristic Linear equations Linear-time algorithms Lower bounds Multiway cut NP-hard problem Optimization Partitioning Polynomial-time data reduction Run time (computers) Studies Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!