Corrigendum: Metric Embedding via Shortest Path Decompositions

IF 1.2 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

SIAM Journal on Computing Pub Date : 2023-10-27 DOI:10.1137/23m1546245

Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman

引用次数: 0

Abstract

This note points out an error in the proof of Theorem 4 in the article “Metric Embedding via Shortest Path Decompositions,” SIAM J. Comput., 51 (2022), pp. 290–314, by the authors, and withdraws the associated claim of Theorem 4.

查看原文本刊更多论文

勘误:通过最短路径分解的度量嵌入

本文指出了SIAM J. Comput文章“通过最短路径分解的度量嵌入”中定理4证明中的一个错误。， 51 (2022)， pp. 290-314，并撤销定理4的相关主张。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

SIAM Journal on Computing 工程技术-计算机：理论方法

CiteScore

4.60

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： The SIAM Journal on Computing aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing. Submissions must be clearly written and make a significant technical contribution. Topics include but are not limited to analysis and design of algorithms, algorithmic game theory, data structures, computational complexity, computational algebra, computational aspects of combinatorics and graph theory, computational biology, computational geometry, computational robotics, the mathematical aspects of programming languages, artificial intelligence, computational learning, databases, information retrieval, cryptography, networks, distributed computing, parallel algorithms, and computer architecture.