Titlebook: Approximation and Online Algorithms; 21st International W Jaros?aw Byrka,Andreas Wiese Conference proceedings 2023 The Editor(s) (if applic

一起

Calcium Metabolism and Kidney Disease,duling problems. We study interesting generalizations of this classical problem involving scenarios. In our model, a scenario is defined as a subset of a predefined and fully specified set of jobs. The aim is to find an assignment of the whole set of jobs to identical parallel machines such that the

APNEA

https://doi.org/10.1007/978-3-642-90683-1imum radius of any cluster is minimized. It is well-studied. But what if we add up the radii of the clusters instead of only considering the cluster with maximum radius? This natural variant is called the .-min-sum-radii problem. It has become the subject of more and more interest in recent years, i

CURB

A. Czerny,Fr. Müller,A. Schittenhelmsome integers . and ., let . be the set of points in . with integral coordinates, and let . be a family of subsets of ., called objects. Both . and . are known in advance by the algorithm and by the adversary. Then, the adversary gives some objects one by one, and the algorithm has to maintain a val

BRAND

https://doi.org/10.1007/978-3-642-90648-0r maximizing the total profit associated with the packed items. We present an approximation scheme under resource augmentation for the circle knapsack problem, i.e., a polynomial-time algorithm that, for any constant ., obtains a solution whose value is within a factor of . of the optimal value, usi

鋪?zhàn)?/a>

鈍劍

Der arterielle Tiefdruck (Hypotonie),lgorithm must output a set of non-conflicting intervals. Traditionally in scheduling theory, it is assumed that intervals arrive in order of increasing start times. We drop that assumption and allow for intervals to arrive in any possible order. We call this variant . (AOIS). We assume that some onl

occult

subacute

Der arterielle Tiefdruck (Hypotonie),imating the maximum-weight independent set in this graph class. For the extremal question, we consider the notion, that we call . .-. of a graph: Given a graph . that is assumed to contain an independent set of a certain (constant) size, we are interested in upper bounding the chromatic number in te

CLEFT

A. Czerny,F. Kraus,A. Schittenhelm It has important applications in, e.g., machine learning and influence maximization. Though the theoretical problem admits polynomial-time approximation algorithms, solving it in practice often involves frequently querying submodular functions that are expensive to compute. This has motivated signi

貧窮地活

Approximation and Online Algorithms978-3-031-49815-2Series ISSN 0302-9743 Series E-ISSN 1611-3349