4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n4/3

Édouard Bonnet
{"title":"4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n4/3","authors":"Édouard Bonnet","doi":"10.1145/3494540","DOIUrl":null,"url":null,"abstract":"We show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0, approximating undirected unweighted Diameter on n-vertex m-edge graphs within ratio 7/4 - ε requires m4/3 - o(1) time, even when m = Õ(n). This is the first result that conditionally rules out a near-linear time 5/3-approximation for undirected Diameter.","PeriodicalId":154047,"journal":{"name":"ACM Transactions on Algorithms (TALG)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Algorithms (TALG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3494540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

We show, assuming the Strong Exponential Time Hypothesis, that for every ε > 0, approximating undirected unweighted Diameter on n-vertex m-edge graphs within ratio 7/4 - ε requires m4/3 - o(1) time, even when m = Õ(n). This is the first result that conditionally rules out a near-linear time 5/3-approximation for undirected Diameter.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
4 vs 7稀疏无向未加权直径在时间n4/3是SETH-hard
我们证明,假设强指数时间假设,对于每一个ε > 0,在7/4 - ε范围内近似n顶点m边图上的无向未加权直径需要m4/3 - 0(1)时间,即使当m = Õ(n)。这是第一个有条件地排除无向直径的近线性时间5/3近似的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Generic Techniques for Building Top-k Structures Deterministic Leader Election in Anonymous Radio Networks A Learned Approach to Design Compressed Rank/Select Data Structures k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms Fully Dynamic (Δ +1)-Coloring in O(1) Update Time
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1