首页> Theory of computing systems> The Ground-Set-Cost Budgeted Maximum Coverage Problem.

The Ground-Set-Cost Budgeted Maximum Coverage Problem.

导出 LinkOut

翻译打印收藏纠错

第一作者： Irving,van Heuven van Staereling

第一单位： Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG The Netherlands.

作者： Irving,van Heuven van Staereling ^[1] ; Bart,de Keijzer ^[2] ; Guido,Schäfer ^[3]

作者单位： Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG The Netherlands. ^[1] Department of Informatics, King's College London, 30 Aldwych, London, WC2B 4BG United Kingdom. ^[2] Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG The Netherlands.;Institute for Logic, Language and Computation, University of Amsterdam, Science Park 107, 1098 XG Amsterdam, The Netherlands. ^[3]

关键词 Approximation algorithms Hypergraphs Maximum coverage problem Sponsored search Submodular optimization

DOI 10.1007/s00224-025-10248-5

PMID 41280270

发布时间 2025-11-24

翻译满意度评价：

准确一般字义偏差语意偏离译文作用小提交

浏览0

Theory of computing systems

2025年69卷4期

39页

相似文献

中文期刊
外文期刊
学位论文
会议论文

浏览0

点击下载本期目录封面

Theory of computing systems

2025年69卷4期

39页

检索历史清除

The Ground-Set-Cost Budgeted Maximum Coverage Problem.

Theory of computing systems

相似文献

同项目论文

Theory of computing systems

相关期刊

参考文献：
指定格式：	NoteExpress EndNote RefWorks NoteFirst

检索历史 清除

The Ground-Set-Cost Budgeted Maximum Coverage Problem.

Theory of computing systems

相似文献

同项目论文

Theory of computing systems

相关期刊

检索历史清除