The Complexity of Finding Fair Many-to-One Matchings

to connected objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
In: ACM Transactions on Algorithms (20:2) - New York : ACM - Art.-Id. 17

Event
Veröffentlichung
(where)
Berlin
(who)
Technische Universität Berlin
(when)
2024
Creator
Boehmer, Niclas
Koana, Tomohiro

DOI
10.14279/depositonce-21268
Handle
11303/22467
URN
urn:nbn:de:101:1-2409040158391.511627653754
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
25.03.2025, 1:58 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

  • Boehmer, Niclas
  • Koana, Tomohiro
  • Technische Universität Berlin

Time of origin

  • 2024

Other Objects (12)

One valve for many purposes - reduced complexity by separation of functions

One valve for many purposes - reduced complexity by separation of functions

Finding fair and efficient allocations

Finding fair and efficient allocations

One school, many cultures

One school, many cultures

One Geonode, many Geonodes

zweidimensionales bewegtes Bild

One Geonode, many Geonodes

One Geonode, many Geonodes

zweidimensionales bewegtes Bild

One Geonode, many Geonodes

One grave too many

One grave too many

One Land, Many Nations

One Land, Many Nations

Vevacious: a tool for finding the global minima of one-loop effective potentials with many scalars

Vevacious: a tool for finding the global minima of one-loop effective potentials with many scalars

Complexity of finding Pareto-efficient allocations of highest welfare

Arbeitspapier

Complexity of finding Pareto-efficient allocations of highest welfare

One fair daughter

One fair daughter

One fair daughter

One fair daughter

One-Act Plays

Abschnitt

One-Act Plays

Related objects