用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: VIRAL
发表于 2025-3-23 13:18:34 | 显示全部楼层
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,
发表于 2025-3-23 16:41:03 | 显示全部楼层
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
发表于 2025-3-23 21:50:25 | 显示全部楼层
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 .
发表于 2025-3-23 22:37:01 | 显示全部楼层
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
发表于 2025-3-24 03:49:34 | 显示全部楼层
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.
发表于 2025-3-24 06:39:38 | 显示全部楼层
发表于 2025-3-24 11:57:31 | 显示全部楼层
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.
发表于 2025-3-24 16:30:44 | 显示全部楼层
发表于 2025-3-24 22:27:20 | 显示全部楼层
发表于 2025-3-25 02:03:35 | 显示全部楼层
978-3-031-16080-6The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-29 01:41
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表