Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Manlove, David F."'
Autor:
Middendorf, Martin, Manlove, David F.
Super-/substring problems and super-/subsequence problems are well-known problems in stringology that have applications in a variety of areas, such as manufacturing systems design and molecular biology. Here we investigate the complexity of a new typ
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A32030
https://ul.qucosa.de/api/qucosa%3A32030/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A32030/attachment/ATT-0/
A kidney exchange is an organized barter market where patients in need of a kidney swap willing but incompatible donors. Determining an optimal set of exchanges is theoretically and empirically hard. Traditionally, exchanges took place in cycles, wit
Externí odkaz:
http://arxiv.org/abs/1606.01623
We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding
Externí odkaz:
http://arxiv.org/abs/1605.04609
We consider the problem of allocating applicants to courses, where each applicant has a subset of acceptable courses that she ranks in strict order of preference. Each applicant and course has a capacity, indicating the maximum number of courses and
Externí odkaz:
http://arxiv.org/abs/1603.00858
The Hospitals / Residents problem with Couples (HRC) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that
Externí odkaz:
http://arxiv.org/abs/1602.01956
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning teachers to sc
Externí odkaz:
http://arxiv.org/abs/1501.05547
Autor:
Cseh, Ágnes, Manlove, David F.
Publikováno v:
Discrete Optimization, 20:62-89, 2016
In the stable marriage and roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually accepted agents. If any two agents
Externí odkaz:
http://arxiv.org/abs/1412.0271
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $G= (A \cup P, E)$ with weights on the edges in $E$, and with lower and upper quotas on the vertices in $P$. We seek a ma
Externí odkaz:
http://arxiv.org/abs/1412.0325
In the Student / Project Allocation problem (SPA) we seek to assign students to individual or group projects offered by lecturers. Students provide a list of projects they find acceptable in order of preference. Each student can be assigned to at mos
Externí odkaz:
http://arxiv.org/abs/1403.0751