Titlebook: Approximation and Online Algorithms; 19th International W Jochen Koenemann,Britta Peis Conference proceedings 2021 Springer Nature Switzerl

幾何學(xué)家

Several Methods of Analysis for Cardinality Constrained Bin Packing,?1] are to be packed into bins, such that no bin has more than . items or total size larger than 1. The goal is to minimize the number of bins..A recently introduced concept, called the price of clustering, deals with inputs that are presented in a way that they are split into clusters. Thus, an ite

酷熱

,Weighted Completion Time Minimization for?Capacitated Parallel Machines,ing environments. We study settings in which the processed jobs may have varying duration, resource requirements and importance (weight). Each server (machine) can process multiple concurrent jobs up?to its capacity. Due to the problem’s .-hardness, we study heuristic approaches with provable approx

entitle

嚴(yán)厲批評(píng)

,FIFO and?Randomized Competitive Packet Routing Games,r arrival time, which depends on one hand on the transit times of the edges and on the other hand on the suffered waiting times. These occur whenever several packets try to enter an edge simultaneously. In those situations, scheduling policies determine which packet is allowed to enter this edge fir

俗艷

Improved Online Algorithm for Fractional Knapsack in the Random Order Model,er, the corresponding online setting has been handled only briefly in the theoretical computer science literature so far, although it appears in several applications. Even the previously best known guarantee for the competitive ratio was worse than the best known for the integral problem in the popu

extemporaneous

,Fractionally Subadditive Maximization Under an?Incremental Knapsack Constraint,o this problem is given by an order in which to include the elements of the ground set, and the competitive ratio of an incremental solution is defined by the worst ratio over all capacities relative to an optimum solution of the corresponding capacity. We present an algorithm that finds an incremen

Hemoptysis

陰郁

,Precedence-Constrained Covering Problems with?Multiplicity Constraints,al order. We examine the general case with multiplicity constraints, where item . can be chosen up to . times. For the basic Precedence-Constrained Knapsack problem (PCKP) we answer an open question of McCormick et al. [.] and show the existence of approximation algorithms with strongly-polynomial b

INCUR

混合物

https://doi.org/10.1007/978-3-030-92702-8Computer Science; Informatics; Conference Proceedings; Research; Applications