| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Christensen, D, et al.
(author)
-
SARS-CoV-2 spike HexaPro formulated in aluminium hydroxide and administered in an accelerated vaccination schedule partially protects Syrian Hamsters against viral challenge despite low neutralizing antibody responses
- 2023
-
In: Frontiers in immunology. - : Frontiers Media SA. - 1664-3224. ; 14, s. 941281-
-
Journal article (peer-reviewed)abstract
- SARS-CoV-2 continues to pose a threat to human health as new variants emerge and thus a diverse vaccine pipeline is needed. We evaluated SARS-CoV-2 HexaPro spike protein formulated in Alhydrogel® (aluminium oxyhydroxide) in Syrian hamsters, using an accelerated two dose regimen (given 10 days apart) and a standard regimen (two doses given 21 days apart). Both regimens elicited spike- and RBD-specific IgG antibody responses of similar magnitude, but in vitro virus neutralization was low or undetectable. Despite this, the accelerated two dose regimen offered reduction in viral load and protected against lung pathology upon challenge with homologous SARS-CoV-2 virus (Wuhan-Hu-1). This highlights that vaccine-induced protection against SARS-CoV-2 disease can be obtained despite low neutralizing antibody levels and suggests that accelerated vaccine schedules may be used to confer rapid protection against SARS-CoV-2 disease.
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
- Kalaitzis, C., et al.
(author)
-
On the configuration LP for maximum budgeted allocation
- 2015
-
In: Mathematical programming. - : Springer. - 0025-5610 .- 1436-4646. ; 154:1-2, s. 427-462
-
Journal article (peer-reviewed)abstract
- We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integrality gap of (Formula presented.), which matches the best known approximation algorithms, our main focus is to improve our understanding of the stronger configuration LP relaxation. In this direction, we prove that the integrality gap of the configuration LP is strictly better than (Formula presented.), and provide corresponding polynomial time roundings, in the following restrictions of the problem: (i) the restricted budgeted allocation problem, in which all the players have the same budget and every item has the same value for any player it can be sold to, and (ii) the graph MBA problem, in which an item can be assigned to at most 2 players. Finally, we improve the best known upper bound on the integrality gap for the general case from (Formula presented.) and also prove hardness of approximation results for both cases.
|
|
| 8. |
- Kalaitzis, C., et al.
(author)
-
On the configuration LP for maximum budgeted allocation
- 2014
-
In: 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014. - Cham : Springer Nature. ; , s. 333-344
-
Conference paper (peer-reviewed)abstract
- We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integrality gap of, which matches the best known approximation algorithms, our main focus is to improve our understanding of the stronger configuration LP relaxation. In this direction, we prove that the integrality gap of the configuration LP is strictly better than, and provide corresponding polynomial time roundings, in the following restrictions of the problem: (i) the Restricted Budgeted Allocation problem, in which all the players have the same budget and every item has the same value for any player it can be sold to, and (ii) the graph MBA problem, in which an item can be assigned to at most 2 players. Finally, we improve the best known upper bound on the integrality gap for the general case from 5/6 to 2√2 2 ≈ 0.828 and also prove hardness of approximation results for both cases.
|
|
| 9. |
|
|
| 10. |
|
|
