![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 853
Volume 853, January 2021
- Xiaoming Sun, Jialin Zhang
:
Special Issue on the International Conference on Algorithmic Aspects in Information and Management 2019 (AAIM'19). 1 - Yufei Huang, Bo Hou, Wen Liu, Lidong Wu, Stephen Rainwater, Suogang Gao:
On approximation algorithm for the edge metric dimension problem. 2-6 - Guanlan Tan, Qilong Feng, Xiangzhong Meng, Jianxin Wang:
A new approximation algorithm for contig-based genomic scaffold filling. 7-15 - Suning Gong, Qingqin Nong, Tao Sun, Qizhi Fang, Ding-Zhu Du, Xiaoyu Shao:
Maximize a monotone function with a generic submodularity ratio. 16-24 - Chuanwen Luo, Wenping Chen
, Deying Li, Yongcai Wang
, Hongwei Du
, Lidong Wu, Weili Wu:
Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks. 25-42 - Limin Wang, Zhao Zhang, Chenchen Wu, Dachuan Xu
, Xiaoyan Zhang:
Approximation algorithms for the dynamic k-level facility location problems. 43-56 - Ruiqi Yang, Shuyang Gu, Chuangen Gao, Weili Wu, Hua Wang, Dachuan Xu
:
A constrained two-stage submodular maximization. 57-64 - Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, Dachuan Xu
:
Approximation algorithms for spherical k-means problem using local search scheme. 65-77
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.