Fair Packing of Independent Sets

DOI10.1007/978-3-030-48966-3_12OpenAlexW3032829168MaRDI QIDQ5041187

Joachim Schauer, Ulrich Pferschy, Nevena Pivač, Matjaž Krnc, Nina Chiarelli, Martin Milanič

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_12

zbMATH Keywords

fair divisionconflict graphpartial coloring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Allocating indivisible items with minimum dissatisfaction on preference graphs ⋮ Fair allocation of indivisible items with conflict graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Paths, trees and matchings under disjunctive constraints
• Scheduling with conflicts: Online and offline algorithms
• Biconvex graphs: Ordering and algorithms
• Minimax relations for the partial q-colorings of a graph
• Algorithmic graph theory and perfect graphs
• Approximation of knapsack problems with conflict and forcing graphs
• Partitioning to three matchings of given size is NP-complete for bipartite graphs
• Algorithms for the Bin Packing Problem with Conflicts
• Restricted Max-Min Fair Allocations with Inclusion-Free Intervals
• The Santa Claus problem
• PTAS for Ordered Instances of Resource Allocation Problems
• The Knapsack Problem with Conflict Graphs
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Graph Classes: A Survey
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• Fair Allocation of Indivisible Goods
• On-line machine covering

This page was built for publication: Fair Packing of Independent Sets