Titlebook: Algorithmic Aspects in Information and Management; 16th International C Qiufen Ni,Weili Wu Conference proceedings 2022 The Editor(s) (if ap

Coordinate

Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function important role in many applications. In recent years, the problem of maximizing a non-negative monotone submodular function minus a linear function under various constraints has gradually emerged and is widely used in many practical scenarios such as team formation and recommendation. In this paper,

平

Monotone ,-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithmr function, where the input consists of . disjoint subsets, instead of a single subset. For the problem under a knapsack constraint, we consider the algorithm that returns the better solution between the single element of highest value and the result of the fully greedy algorithm, to which we refer

Limited

Guarantees for Maximization of ,-Submodular Functions with a Knapsack and a Matroid Constrainte apply a greedy and local search technique to obtain a .-approximate algorithm for the problem of maximizing a .-submodular function subject to the intersection of a knapsack constraint and a matroid constraint. Furthermore, we use a special analytical method to improve the approximation ratio to .

犬儒主義者

Defense of Scapegoating Attack in Network Tomographymake all the links in the network be identifiable. This requires very high monitoring cost. To overcome this problem, this paper proposes a diagnosis-based defending scheme for scapegoating attack. A scapegoating attack can be launched only when the link set manipulated by the attacker cuts the prob

PATHY

An Approximation Algorithm for?the?Clustered Path Travelling Salesman Problemg the triangle inequality. In addition, the vertex set . is partitioned into clusters .. The objective of the problem is to find a minimum Hamiltonian path in ., and in the path all vertices of each cluster are visited consecutively. We provide a polynomial-time approximation algorithm for the problem.

Anthropoid

乞討

Guarantees for Maximization of ,-Submodular Functions with a Knapsack and a Matroid Constrainte apply a greedy and local search technique to obtain a .-approximate algorithm for the problem of maximizing a .-submodular function subject to the intersection of a knapsack constraint and a matroid constraint. Furthermore, we use a special analytical method to improve the approximation ratio to ., when the .-submodular function is monotone.

注射器

廣大

BILK

978-3-031-16080-6The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl