On Min Sum Vertex Cover and Generalized Min Sum Set Cover-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On Min Sum Vertex Cover and Generalized Min Sum Set Cover

Published:2023-03-09 Issue:2 Volume:52 Page:327-357
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Bansal Nikhil¹,Batra Jatin²^ORCID,Farhadi Majid³,Tetali Prasad⁴

Affiliation:

1. Department of Computer Science and Engineering, University of Michigan, Ann Arbor, MI 48109 USA.

2. School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai 400005 India.

3. Jump Trading LLC, Chicago, IL 60654 USA.

4. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213 USA.

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Reference19 articles.

1. On Chromatic Sums and Distributed Resource Allocation

2. A projected gradient algorithm for solving the maxcut SDP relaxation

3. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine

4. A threshold of ln n for approximating set cover

5. Approximating Min-sum Set Cover

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP