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...

Full description

Bibliographic Details

Published in:	Networks Vol. 86; no. 2; pp. 220 - 237
Main Authors:	Segschneider, Jenny, Koster, Arie M. C. A.
Format:	Journal Article
Language:	English
Published:	Hoboken, USA John Wiley & Sons, Inc 01.09.2025 Wiley Subscription Services, Inc
Subjects:	Complexity computational complexity directed matching graph and network algorithms Matching Polynomials robust optimization Robustness Uncertainty
ISSN:	0028-3045, 1097-0037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!