A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.


https://doi.org/10.4230/LIPIcs.ISAAC.2017.66
@inproceedings{DBLP:conf/isaac/XuCLLL017, author = {Yao Xu and Yong Chen and Guohui Lin and Tian Liu and Taibo Luo and Peng Zhang}, editor = {Yoshio Okamoto and Takeshi Tokuyama}, title = {A {(1.4} + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem}, booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC} 2017, December 9-12, 2017, Phuket, Thailand}, series = {LIPIcs}, volume = {92}, pages = {66:1--66:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.66}, doi = {10.4230/LIPIcs.ISAAC.2017.66}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/isaac/XuCLLL017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21