Satisfying neighbor preferences on a circle

DOI10.1007/978-3-319-77404-6_53MaRDI QIDQ2294731zbMATH OpenOpenAlexFDO

Authors D. Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil Shende

Publication date 12 February 2020

Full work available at URL https://doi.org/10.1007/978-3-319-77404-6_53

zbMATH Keywords

FPT algorithmlinear algorithmseating arrangement

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Preferences Single-Peaked on a Circle
• Optimum seating arrangements and Tuscan squares.
• Allocation of indivisible items with individual preference graphs
• How hard is it to satisfy (almost) all roommates?
• Structured preferences: a literature survey

Cited in

(1)

• On perfect colorings of infinite multipath graphs

This page was built for publication: Satisfying neighbor preferences on a circle

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