Approximating Queries on Probabilistic Graphs

Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of approximation algorithms, and particularly of combined FPRASes, with runtime polynomial in both the query and instance size....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-11
Hauptverfasser:	Amarilli, Antoine, Timothy van Bremen, Gaspard, Octave, Meel, Kuldeep S
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Complexity Graph theory Graphs Lower bounds Network reliability Polynomials Queries
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!