View in EDS

FRACTIONALLY SUBADDITIVE MAXIMIZATION UNDER AN INCREMENTAL KNAPSACK CONSTRAINT WITH APPLICATIONS TO INCREMENTAL FLOWS.

Saved in:
Bibliographic Details
Title: FRACTIONALLY SUBADDITIVE MAXIMIZATION UNDER AN INCREMENTAL KNAPSACK CONSTRAINT WITH APPLICATIONS TO INCREMENTAL FLOWS.
Authors: DISSER, YANN1 disser@mathematik.tu-darmstadt.de, KLIMM, MAX2 klimm@math.tu-berlin.de, LUTZ, ANNETTE1 lutz@mathematik.tu-darmstadt.de, WECKBECKER, DAVID1 weckbecker@mathematik.tu-darmstadt.de
Source: SIAM Journal on Discrete Mathematics. 2024, Vol. 38 Issue 1, p764-789. 26p.
Subjects: Backpacks, Algorithms
Abstract: We consider the problem of maximizing a fractionally subadditive function under an increasing knapsack constraint. An incremental solution to 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 incremental solution of competitive ratio at most max\{ 3.293 M, 2M\}, under the assumption that the values of singleton sets are in the range [1,M], and we give a lower bound of max\{ 2.618,M\} on the attainable competitive ratio. In addition, we establish that our framework captures potential-based flows between two vertices, and we give a lower bound of max\{ 2,M\} and an upper bound of 2M for the incremental maximization of classical flows with capacities in [1,M] which is tight for the unit capacity case. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Discrete Mathematics is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:We consider the problem of maximizing a fractionally subadditive function under an increasing knapsack constraint. An incremental solution to 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 incremental solution of competitive ratio at most max\{ 3.293 M, 2M\}, under the assumption that the values of singleton sets are in the range [1,M], and we give a lower bound of max\{ 2.618,M\} on the attainable competitive ratio. In addition, we establish that our framework captures potential-based flows between two vertices, and we give a lower bound of max\{ 2,M\} and an upper bound of 2M for the incremental maximization of classical flows with capacities in [1,M] which is tight for the unit capacity case. [ABSTRACT FROM AUTHOR]
ISSN:08954801
DOI:10.1137/23M1569265