Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes

ABSTRACT The b$$ b $$‐matching problem is a well‐known generalization of the classical matching problem with various applications in operations research and computer science. Given an undirected graph, each vertex v$$ v $$ has a capacity bv$$ {b}_v $$, indicating the maximum number of times it can b...

Celý popis

Podrobná bibliografia

Vydané v:	Networks Ročník 86; číslo 2; s. 220 - 237
Hlavní autori:	Segschneider, Jenny, Koster, Arie M. C. A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken, USA John Wiley & Sons, Inc 01.09.2025 Wiley Subscription Services, Inc
Predmet:	Complexity computational complexity directed matching graph and network algorithms Matching Polynomials robust optimization Robustness Uncertainty
ISSN:	0028-3045, 1097-0037
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!