Finding popular branchings in vertex-weighted digraphs
From MaRDI portal
Publication:2154110
DOI10.1007/978-3-030-96731-4_25OpenAlexW3204690823MaRDI QIDQ2154110
Publication date: 13 July 2022
Full work available at URL: https://arxiv.org/abs/2110.03460
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal popular matchings
- Popular edges and dominant matchings
- Popular branchings and their dual certificates
- Popular Matchings
- Popular Matchings in the Marriage and Roommates Problems
- Packing rooted directed cuts in a weighted directed graph
- Quasi-popular Matchings, Optimality, and Extended Formulations
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- Weighted popular matchings
This page was built for publication: Finding popular branchings in vertex-weighted digraphs
