Weitian Tong
Orcid: 0000-0002-9815-2330
According to our database1,
Weitian Tong
authored at least 52 papers
between 2012 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops.
Ann. Oper. Res., April, 2024
Robust Transformer-based model for spatiotemporal PM<sub>2.5</sub> prediction in California.
Earth Sci. Informatics, February, 2024
2023
Earth Sci. Informatics, September, 2023
Comput. Oper. Res., 2023
2022
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint.
Theor. Comput. Sci., 2022
J. Comb. Optim., 2022
Eur. J. Oper. Res., 2022
An efficient polynomial-time approximation scheme for parallel multi-stage open shops.
CoRR, 2022
Proceedings of the International Conference on Computational Science and Computational Intelligence, 2022
2021
Optim. Lett., 2021
Inf. Sci., 2021
An improved approximation algorithm for the minimum common integer partition problem.
Inf. Comput., 2021
Learning with self-attention for rental market spatial dynamics in the Atlanta metropolitan area.
Earth Sci. Informatics, 2021
Proceedings of the International Conference on Computational Science and Computational Intelligence, 2021
2020
Earth Sci. Informatics, 2020
A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops.
Eur. J. Oper. Res., 2020
2019
An approximation algorithm for genome sorting by reversals to recover all adjacencies.
J. Comb. Optim., 2019
Modeling Housing Rent in the Atlanta Metropolitan Area Using Textual Information and Deep Learning.
ISPRS Int. J. Geo Inf., 2019
Earth Sci. Informatics, 2019
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
2018
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops.
Theor. Comput. Sci., 2018
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression.
Algorithmica, 2018
2017
Wirel. Commun. Mob. Comput., 2017
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72].
Theor. Comput. Sci., 2017
Cooperative adaptive cruise control of connected and autonomous vehicles subject to input saturation.
Proceedings of the 8th IEEE Annual Ubiquitous Computing, 2017
2016
An energy efficient privacy-preserving content sharing scheme in mobile social networks.
Pers. Ubiquitous Comput., 2016
Optim. Lett., 2016
Comput. Oper. Res., 2016
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016
2015
Theor. Comput. Sci., 2015
Eur. J. Oper. Res., 2015
2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.
Theor. Comput. Sci., 2014
Proceedings of the Theory and Applications of Models of Computation, 2014
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014
Proceedings of the Combinatorial Optimization and Applications, 2014
2013
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012