EN
LOGIN
REGISTER
×
Logging off
All data generated by the account on the platform will be deleted after logout.
Tsinghua Science and Technology
ISSN 1007-0214
e-ISSN 1878-7606
CN 11-3745/N
Editor-in-Chief: Jiaguang Sun
Open Access
Journal Home
Articles & Issues
Articles & Issues
Just Accepted
Latest Issue
All Issues
×
New Search
Advanced Search
Journal Alert
Tsinghua Science and Technology
Alert type: Latest Issue
Frequency:
As published
Alert type: Online First
Frequency:
Month
Week
Day
RSS feed for
Tsinghua Science and Technology
Paste the URL in your RSS reader:
https://www.sciopen.com/journal/rss/1007-0214
Link copied
复制
Journal Home
>
Keyword
Keyword:
approximation algorithm
Search in:
this journal
|
the platform
Open Access
Distances Between Phylogenetic Trees: A Survey
Feng Shi, Qilong Feng, Jianer Chen,
[...],
Lusheng Wang,
Jianxin Wang
<< Fewer
https://doi.org/10.1109/TST.2013.6616522
Published: 03 October 2013
2013, 18 (5): 490-499
Downloads:
8
|
Views:
338
|
PDF
(270.3 KB)
Open Access
Utility Aware Offloading for Mobile-Edge Computing
Ran Bi, Qian Liu, Jiankang Ren,
Guozhen Tan
https://doi.org/10.26599/TST.2019.9010062
Published: 24 July 2020
2021, 26 (2): 239-250
Downloads:
37
|
Views:
492
|
PDF
(456 KB)
Open Access
Approximation Algorithm for the Balanced 2-Correlation Clustering Problem
Sai Ji, Dachuan Xu, Donglei Du,
[...],
Ling Gai,
Zhongrui Zhao
<< Fewer
https://doi.org/10.26599/TST.2021.9010051
Published: 17 March 2022
2022, 27 (5): 777-784
Downloads:
110
|
Views:
599
|
PDF
(4 MB)
Open Access
Algorithms for the Prize-Collecting
k
-Steiner Tree Problem
Lu Han, Changjun Wang, Dachuan Xu,
Dongmei Zhang
https://doi.org/10.26599/TST.2021.9010053
Published: 17 March 2022
2022, 27 (5): 785-792
Downloads:
56
|
Views:
447
|
PDF
(829.3 KB)
Open Access
A Two-Stage Method for Routing in Field-Programmable Gate Arrays with Time-Division Multiplexing
Peihuang Huang, Longkun Guo, Long Sun,
Xiaoyan Zhang
https://doi.org/10.26599/TST.2021.9010092
Published: 21 June 2022
2022, 27 (6): 902-911
Downloads:
78
|
Views:
492
|
PDF
(2.7 MB)
Open Access
k
-Submodular Maximization with a Knapsack Constraint and
p
Matroid Constraints
Qian Liu, Kemin Yu, Min Li,
Yang Zhou
https://doi.org/10.26599/TST.2022.9010039
Published: 19 May 2023
2023, 28 (5): 896-905
Downloads:
72
|
Views:
349
|
PDF
(2.4 MB)
Open Access
Approximating
(
m
B
,
m
P
)
-Monotone BP Maximization and Extensions
Ruiqi Yang, Suixiang Gao, Lu Han,
[...],
Gaidi Li,
Zhongrui Zhao
<< Fewer
https://doi.org/10.26599/TST.2022.9010033
Published: 19 May 2023
2023, 28 (5): 906-915
Downloads:
22
|
Views:
272
|
PDF
(1.4 MB)
Open Access
Exact and Approximation Algorithms for the Multi-Depot Capacitated Arc Routing Problems
Wei Yu, Yujie Liao, Yichen Yang
https://doi.org/10.26599/TST.2022.9010052
Published: 19 May 2023
2023, 28 (5): 916-928
Downloads:
41
|
Views:
193
|
PDF
(1.9 MB)
Open Access
Efficient Algorithm for the
k
-Means Problem with Must-Link and Cannot-Link Constraints
Chaoqi Jia, Longkun Guo, Kewen Liao,
Zhigang Lu
https://doi.org/10.26599/TST.2022.9010056
Published: 28 July 2023
2023, 28 (6): 1050-1062
Downloads:
18
|
Views:
215
|
PDF
(5 MB)
Open Access
Approximation Algorithms for Graph Partition into Bounded Independent Sets
Jingwei Xie, Yong Chen, An Zhang,
Guangting Chen
https://doi.org/10.26599/TST.2022.9010062
Published: 28 July 2023
2023, 28 (6): 1063-1071
Downloads:
20
|
Views:
174
|
PDF
(5.5 MB)
total 12
×