Length-constrained path-matchings in graphs

The path‐matching problem is to find a set of vertex‐ or edge‐disjoint paths with length constraints in a given graph with a given set of endpoints. This problem has several applications in broadcasting and multicasting in computer networks. In this paper, we study the algorithmic complexity of diff...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 2002-07, Vol.39 (4), p.210-215
Hauptverfasser:	Ghodsi, M., Hajiaghayi, M. T., Mahdian, M., Mirrokni, V. S.
Format:	Artikel
Sprache:	eng
Schlagworte:	algorithms Applied sciences Artificial intelligence Computer science control theory systems Connectionism. Neural networks Exact sciences and technology Flows in networks. Combinatorial problems matching NP-completeness Operational research and scientific management Operational research. Management science path-matching pseudo-matching
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!