| 中文标题 | 作者 | 论文ID | 分类简称 | 发布时间 |
|---|---|---|---|---|
| 区间约束的参数化复杂性分类 | Konrad K. Dabrowski and Peter Jonsson and Sebastian Ordyniak and George Osipov and Marcin Pilipczuk and Roohani Sharma | 2305.13889 | cs.DS | 2023-05-24 |
| 哪个$L_p$范数最公平？在所有"$p$"下进行公平设施选址的近似方法 | Swati Gupta, Jai Moondra, Mohit Singh | 2211.14873 | cs.DS | 2023-05-23 |
| 有界度有向图的两个属性测试模型间的最优分离 | Pan Peng, Yuyang Wang | 2305.13089 | cs.DS | 2023-05-23 |
| 多商品电子商务订单的顺序最优相关取整 | Will Ma | 2207.04774 | cs.DS | 2023-05-22 |
| 通过彩虹匹配实现图打包问题的内核化 | St''ephane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht | 2207.06874 | cs.DS | 2023-05-22 |
| 不使用ε消除左递归 | James Smith | 1908.10888 | cs.DS | 2023-05-19 |
| 空间高效内点法：线性规划和最大权重二分匹配的应用 | S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, Tianyi Zhou | 2009.06106 | cs.DS | 2023-05-19 |
| 选定网络设计和匹配问题的子模性间隙 | Martin B"ohm, Jaros{l}aw Byrka, Mateusz Lewandowski and Jan Marcinkowski | 2305.10935 | cs.DS | 2023-05-19 |
| 相等最小CSP的参数化复杂性 | George Osipov and Magnus Wahlstr"om | 2305.11131 | cs.DS | 2023-05-19 |
| 非自适应最短路径松弛的下界 | David Eppstein | 2305.09230 | cs.DS | 2023-05-17 |
| 大规模图的$k$-双模拟计算：比较和效率分析 | Jannik Rau and David Richerby and Ansgar Scherp | 2204.05821 | cs.DS | 2023-05-16 |
| 具有分割矩阵的装箱问题可以在$O(OPT)$以内近似解决 | Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai | 2212.01025 | cs.DS | 2023-05-16 |
| 受限秩超图的超树宽参数的常比FPT近似 | Igor Razgon | 2212.13423 | cs.DS | 2023-05-16 |
| 流中伪确定性计数的下界 | Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan and Shay Sapir | 2303.16287 | cs.DS | 2023-05-16 |
| 根据您的要求，以下是标题的中文翻译： $2$-$3$-集合覆盖问题以及根有向无环图的最大叶子生成森林问题的$\frac{4}{3}$近似算法 | Meike Neuwohner | 2305.07808 | cs.DS | 2023-05-16 |
| 线性大小的稀疏化器通过近线性时间的不一致性理论 | Arun Jambulapati, Victor Reis, Kevin Tian | 2305.08434 | cs.DS | 2023-05-16 |
| 具有次二次调色板大小的流式边缘着色 | Shiri Chechik, Doron Mukhtar, Tianyi Zhang | 2305.07090 | cs.DS | 2023-05-15 |
| 树的最小一致子集再探讨 | Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi | 2305.07259 | cs.DS | 2023-05-15 |
| 匹配统计加速BWT构建 | Francesco Masillo | 2305.07319 | cs.DS | 2023-05-15 |
| 简单迭代抽样算法实现有向超图的近乎紧密谱稀疏化 | Kazusato Oko, Shinsaku Sakaue, Shin-ichi Tanigawa | 2204.02537 | cs.DS | 2023-05-12 |
| 有界加权编辑距离的最优算法 | Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz | 2305.06659 | cs.DS | 2023-05-12 |
| 宽度助益与阻碍流的分割 | Manuel C''aceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams | 2207.02136 | cs.DS | 2023-05-11 |
| 通过平滑快照改进的最大有向割流算法 | Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy | 2211.03916 | cs.DS | 2023-05-11 |
| 近似最大权重二分图匹配的乘法拍卖算法 | Da Wei Zheng and Monika Henzinger | 2301.09217 | cs.DS | 2023-05-11 |
| 通过无前缀解析加速FM-index查询 | Aaron Hong, Marco Oliva, Dominik K"oppl, Hideo Bannai, Christina Boucher and Travis Gagie | 2305.05893 | cs.DS | 2023-05-11 |