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 Jg. 220; S. 134 - 160
Hauptverfasser:	van Bevern, René, Bredereck, Robert, Chopin, Morgan, Hartung, Sepp, Hüffner, Falk, Nichterlein, André, Suchý, Ondřej
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 31.03.2017 Elsevier BV
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) Evaluating heuristics NP-hard problem Algorithm engineering Multiway cut Graph algorithms Linear-time algorithms Polynomial-time data reduction
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!