Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections-Reference-Cited by-同舟云学术

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

Online vector bin packing and hypergraph coloring illuminated: simpler proofs and new connections

Published:2023 Issue: Volume:223 Page:70-77
ISSN:1877-0509
Container-title:Procedia Computer Science
language:en
Short-container-title:Procedia Computer Science

Author:

Li Yaqiao,Pankratov Denis

Funder

Natural Sciences and Engineering Research Council of Canada

Publisher

Elsevier BV

Subject

General Engineering

Reference7 articles.

1. Tight bounds for online vector bin packing;Azar,2013

2. Online hypergraph coloring;Nagy-György;Information Processing Letters,2008

3. An on-line graph coloring algorithm with sublinear performance ratio;Lovász;Discrete Mathematics,1989

4. Lower bounds for on-line graph coloring;Halldórsson;Theoretical Computer Science,1994

5. Randomized online graph coloring;Vishwanathan;Journal of Algorithms,1992

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP