↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Träfflista för sökning "WFRF:(Overmars M) "

Search: WFRF:(Overmars M)

Result 1-5 of 5

Sort/group result

Sort by: Hits per page:

Enumeration	Reference	Cover	Find
1.	Brackel, CLH, et al. (author) International Care programs for Pediatric Post-COVID Condition (Long COVID) and the way forward 2024 In: Pediatric research. - 1530-0447. Journal article (peer-reviewed)
2.	Raasveld, SJ, et al. (author) RBC Transfusion in Venovenous Extracorporeal Membrane Oxygenation: A Multicenter Cohort Study 2022 In: Critical care medicine. - 1530-0293. ; 50:2, s. 224-234 Journal article (peer-reviewed)
3.	Raasveld, SJ, et al. (author) Transfusion of red blood cells in venoarterial extracorporeal membrane oxygenation: A multicenter retrospective observational cohort study 2023 In: Transfusion. - 1537-2995. ; 63:10, s. 1809-1820 Journal article (peer-reviewed)
4.	van Haeren, MMT, et al. (author) Plasma Transfusion and Procoagulant Product Administration in Extracorporeal Membrane Oxygenation: A Secondary Analysis of an International Observational Study on Current Practices 2023 In: Critical care explorations. - 2639-8028. ; 5:8, s. e0949- Journal article (peer-reviewed)
5.	de Berg, M, et al. (author) TSP with neighborhoods of varying size 2005 In: Journal of Algorithms. - : Elsevier BV. - 1090-2678 .- 0196-6774. ; 57:1, s. 22-36 Journal article (peer-reviewed)abstract In TSP with neighborhoods (TSPN) we are given a collection S of regions in the plane, called neighborhoods, and we seek the shortest tour that visits all neighborhoods. Until now constant-factor approximation algorithms have been known only for cases where the neighborhoods are of approximately the same size. In this paper we present the first polynomial-time constant-factor approximation algorithm for disjoint convex fat neighborhoods of arbitrary size. We also show that in the general case, where the neighborhoods can overlap and are not required to be convex or fat, TSPN is APX-hard and cannot be approximated within a factor of 391/390 in polynomial time, unless P = NP.

Skapa referenser, mejla, bekava och länka

Permalink

Result 1-5 of 5

Refine your search

Type of publication: journal article (5)

Type of content: peer-reviewed (5)

Author/Editor: Taccone, FS (3); Broman, LM (3); Lorusso, R (3); Pappalardo, F (3); Peluso, L (2); Edwards, A. (1); show more...; Vijverberg, SJH (1); Hashimoto, S (1); Stephenson, T. (1); Lorenz, M. (1); Hertting, O (1); de Berg, M (1); Gudmundsson, J (1); van Goudoever, JB (1); Shafran, R (1); Levcopoulos, Christo ... (1); Villard, L. (1); Rasche, M (1); Brackel, CLH (1); Noij, LCE (1); Legghe, CL (1); van der Zee, AH (1); Buonsenso, D (1); Munblit, D (1); Sigfrid, L (1); Mcfarland, S (1); Anmyr, L (1); Ashkenazi-Hoffnung, ... (1); Bellinat, APN (1); Dias, NLS (1); Fashina, T (1); Juraski, RG (1); Goncalves, ALN (1); Hansted, E (1); Herczeg, V (1); Jankauskaite, LN (1); Kaswandani, N (1); Kevalas, R (1); Krivacsy, P (1); Malone, LA (1); Mcvoy, M (1); Miller, DW (1); Morrow, AK (1); Nugawela, MD (1); Oliveira, CR (1); Oliveira, PRS (1); Osmanov, IM (1); Overmars, IM (1); Paintsil, E (1); Pereira, SMP (1); show less...

University: Karolinska Institutet (4); Lund University (1)

Language: English (5)

Research subject (UKÄ/SCB): Natural sciences (1)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

Copyright © LIBRIS - National Library Systems
LIBRIS.kb.se

pil uppåt

Close

Copy and save the link in order to return to this view