Copertina

On Approximate MMS Allocations on Restricted Graph Classes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Blažej, Václav, Dębski, Michał, Lonc, Zbigniew, Piecyk, Marta, Rzążewski, Paweł
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Discrete Mathematics Artificial Intelligence
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

List coloring ordered graphs with forbidden induced subgraphs
di: Piecyk, Marta, et al.
Pubblicazione: (2025)

Bears with Hats and Independence Polynomials
di: Blažej, Václav, et al.
Pubblicazione: (2021)

Tree-independence number of $P_5$-free graphs with no large bicliques
di: Blažej, Václav, et al.
Pubblicazione: (2026)

Graph Reconstruction with Connectivity Queries
di: Kluk, Kacper, et al.
Pubblicazione: (2024)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
di: Pilipczuk, Marcin, et al.
Pubblicazione: (2023)

Polynomial-time recognition and maximum independent set in Burling graphs
di: Rzążewski, Paweł, et al.
Pubblicazione: (2024)

Complexity Aspects of Homomorphisms of Ordered Graphs
di: Čertík, Michal, et al.
Pubblicazione: (2025)

On Computational Aspects of Cores of Ordered Graphs
di: Čertík, Michal, et al.
Pubblicazione: (2025)

Pushing the Frontier on Approximate EFX Allocations
di: Amanatidis, Georgios, et al.
Pubblicazione: (2024)

Transition Graph Properties of Target Class Classification
di: Aslanyan, Levon, et al.
Pubblicazione: (2024)

Induced matching treewidth and tree-independence number, revisited
di: Alon, Noga, et al.
Pubblicazione: (2025)

Coloring and Recognizing Directed Interval Graphs
di: Gutowski, Grzegorz, et al.
Pubblicazione: (2023)

Hitting all longest paths in $H$-free graphs and $H$-graphs
di: de Lima, Paloma T., et al.
Pubblicazione: (2025)

Detection of decision-making manipulation in the pairwise comparisons method
di: Strada, Michał, et al.
Pubblicazione: (2024)

On coarse tree decompositions and coarse balanced separators
di: Abrishami, Tara, et al.
Pubblicazione: (2025)

On Computational Aspects of Ordered Matching Problems
di: Čertík, Michal, et al.
Pubblicazione: (2025)

HyColor: An Efficient Heuristic Algorithm for Graph Coloring
di: Zhu, Enqiang, et al.
Pubblicazione: (2025)

Clique-width and induced topological minors
di: Bieliński, Paweł Rafał, et al.
Pubblicazione: (2026)

Are Graph Neural Networks Optimal Approximation Algorithms?
di: Yau, Morris, et al.
Pubblicazione: (2023)

An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs
di: Bonnet, Édouard, et al.
Pubblicazione: (2024)

A Multi-Objective Genetic Algorithm for Healthcare Workforce Scheduling
di: Patel, Vipul, et al.
Pubblicazione: (2025)

Revisiting FastMap: New Applications
di: Li, Ang
Pubblicazione: (2025)

Degree-Based Logical Adjacency Checking (DBLAC): A Novel Heuristic for Vertex Coloring
di: Verma, Prashant
Pubblicazione: (2025)

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes
di: Asadi, Ali, et al.
Pubblicazione: (2025)

GDBA Revisited: Unleashing the Power of Guided Local Search for Distributed Constraint Optimization
di: Deng, Yanchen, et al.
Pubblicazione: (2025)

A Fast GRASP Metaheuristic for the Trigger Arc TSP with MIP-Based Construction and Multi-Neighborhood Local Search
di: Soler, Joan Salvà, et al.
Pubblicazione: (2025)

A mathematical model for simultaneous personnel shift planning and unrelated parallel machine scheduling
di: Khadivi, Maziyar, et al.
Pubblicazione: (2024)

Feature-Guided Metaheuristic with Diversity Management for Solving the Capacitated Vehicle Routing Problem
di: Herdianto, Bachtiar, et al.
Pubblicazione: (2024)

Manipulation of individual judgments in the quantitative pairwise comparisons method
di: Strada, M., et al.
Pubblicazione: (2022)

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
di: Lucci, Mauro, et al.
Pubblicazione: (2021)

Mean-based incomplete pairwise comparisons method with the reference values
di: Kułakowski, Konrad, et al.
Pubblicazione: (2022)

My part is bigger than yours -- assessment within a group of peers
di: Kułakowski, Konrad, et al.
Pubblicazione: (2024)

Logic-Constrained Shortest Paths for Flight Planning
di: Euler, Ricardo, et al.
Pubblicazione: (2024)

ReLU Networks for Exact Generation of Similar Graphs
di: Ghafoor, Mamoona, et al.
Pubblicazione: (2026)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
di: Mehrabian, Abbas, et al.
Pubblicazione: (2023)

Constant congestion brambles in directed graphs
di: Masařík, Tomáš, et al.
Pubblicazione: (2021)

Max Weight Independent Set in sparse graphs with no long claws
di: Abrishami, Tara, et al.
Pubblicazione: (2023)

In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
di: Davila, Randy, et al.
Pubblicazione: (2025)

The Packing Chromatic Number of the Infinite Square Grid is 15
di: Subercaseaux, Bernardo, et al.
Pubblicazione: (2023)

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
di: Gadekar, Ameet, et al.
Pubblicazione: (2024)