Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 8.

Journal Article

Antoniadis, Antonios ORCID: 0000-0003-2152-7883, Fleszar, Krzysztof, Hoeksma, Ruben ORCID: 0000-0002-6553-7242 and Schewior, Kevin ORCID: 0000-0003-2236-0210 (2020). A PTAS for Euclidean TSP with Hyperplane Neighborhoods. ACM Trans. Algorithms, 16 (3). NEW YORK: ASSOC COMPUTING MACHINERY. ISSN 1549-6333

Antoniadis, Antonios ORCID: 0000-0003-2152-7883, Hoeksma, Ruben ORCID: 0000-0002-6553-7242, Kisfaludi-Bak, Sandor ORCID: 0000-0002-6856-2902 and Schewior, Kevin ORCID: 0000-0003-2236-0210 (2022). Online search for a hyperplane in high-dimensional Euclidean space. Inf. Process. Lett., 177. AMSTERDAM: ELSEVIER. ISSN 1872-6119

Bampis, Evripidis, Escoffier, Bruno, Schewior, Kevin and Teiller, Alexandre (2021). Online Multistage Subset Maximization Problems. Algorithmica, 83 (8). S. 2374 - 2400. NEW YORK: SPRINGER. ISSN 1432-0541

Bjelde, Antje, Hackfeld, Jan, Disser, Yann, Hansknecht, Christoph, Lipmann, Maarten, Meissner, Julie, Schloter, Miriam, Schewior, Kevin ORCID: 0000-0003-2236-0210 and Stougie, Leen (2021). Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms, 17 (1). NEW YORK: ASSOC COMPUTING MACHINERY. ISSN 1549-6333

Chen, Lin ORCID: 0000-0003-3909-4916, Eberle, Franziska ORCID: 0000-0001-8636-9711, Megow, Nicole ORCID: 0000-0002-3531-7644, Schewior, Kevin ORCID: 0000-0003-2236-0210 and Stein, Cliff (2020). A general framework for handling commitment in online throughput maximization. Math. Program., 183 (1-2). S. 215 - 248. HEIDELBERG: SPRINGER HEIDELBERG. ISSN 1436-4646

Correa, Jose ORCID: 0000-0002-3012-7622, Dutting, Paul, Fischer, Felix ORCID: 0000-0002-8403-9273 and Schewior, Kevin . Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution. Math. Oper. Res.. CATONSVILLE: INFORMS. ISSN 1526-5471

Eckl, Alexander, Kirschbaum, Anja, Leichter, Marilena ORCID: 0000-0002-1677-4786 and Schewior, Kevin (2021). A stronger impossibility for fully online matching. Oper. Res. Lett., 49 (5). S. 802 - 809. AMSTERDAM: ELSEVIER. ISSN 1872-7468

Huang, Chien-Chung, Mari, Mathieu, Mathieu, Claire, Schewior, Kevin and Vygen, Jens (2021). AN APPROXIMATION ALGORITHM FOR FULLY PLANAR EDGE-DISJOINT PATHS. SIAM Discret. Math., 35 (2). S. 752 - 770. PHILADELPHIA: SIAM PUBLICATIONS. ISSN 1095-7146

This list was generated on Mon Dec 11 08:08:39 2023 CET.