Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue
ACM Transactions on Algorithms(2018)
摘要
We are delighted to present a Special Issue of ACM Transactions on Algorithms, containing full versions of seven papers that were presented at the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016) in Arlington, Virginia, on January 10–12, 2016. These papers, selected on the basis of their high ratings by the conference program committee, have been thoroughly reviewed according to the journal’s highest standards. In “Near-Optimal Light Spanners,” Shiri Chechik and Christian Wulff-Nilsen ( https://doi. org/10.1145/3199607) make fundamental progress on light spanner construction. They show that any graph on n vertices admits a spanner of stretch (2k-1)(1+ ɛ) with O (n1+ 1/k) edges and total weight at most O (n1/k) times that of the minimum spanning tree (for any fixed ɛ> 0). This result is the best possible up to the (1+ ɛ) factor in the stretch assuming Erdos’ girth conjecture. The paper …
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络