Fairness in graph-theoretical optimization problems

DOI10.1016/J.DAM.2025.05.026MaRDI QIDQ6950391zbMATH OpenFDO

Authors Christopher Hojny, Frits C. R. Spieksma, Sten Wessel

Publication date 31 July 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.05.026

zbMATH Keywords

column generationfairnessindependent setmatchingset systems

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Matching models (91B68)

Cites work

• A new polynomial-time algorithm for linear programming
• Fair integer programming under dichotomous and cardinal preferences
• Fair-by-design matching
• Fairness through awareness
• scientific article; zbMATH DE number 5781599 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 6116733 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• Matchings and covers in hypergraphs
• On an estimate of the chromatic class of a \(p\)-graph
• On fair covering and hitting problems
• On matching cover of graphs
• The 1-Factors of Oriented Graphs
• The complexity of restricted spanning tree problems
• The ellipsoid method and its consequences in combinatorial optimization
• The structural complexity landscape of finding balance-fair shortest paths

This page was built for publication: Fairness in graph-theoretical optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950391)