Weitian Tong

According to our database1, Weitian Tong authored at least 43 papers between 2012 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint.
Theor. Comput. Sci., 2022

Online crowdsourced truck delivery using historical information.
Eur. J. Oper. Res., 2022

An efficient polynomial-time approximation scheme for parallel multi-stage open shops.
CoRR, 2022

A PTAS for parallel two-stage flowshops under makespan constraint.
CoRR, 2022

Online procurement problem with risk hedging.
Comput. Ind. Eng., 2022

Multiple sink location problem in path networks with a combinational objective.
Optim. Lett., 2021

No-wait two-stage flowshop problem with multi-task flexibility of the first machine.
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

Deep learning spatiotemporal air pollution data in China using data fusion.
Earth Sci. Informatics, 2020

A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops.
Eur. J. Oper. Res., 2020

Single-machine scheduling with job-dependent machine deterioration.
J. Sched., 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

Efficient spatiotemporal interpolation with spark machine learning.
Earth Sci. Informatics, 2019

Online minimum latency problem with edge uncertainty.
Eur. J. Oper. Res., 2019

A 21/16-Approximation for the Minimum 3-Path Partition Problem.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

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

An Advanced Private Social Activity Invitation Framework with Friendship Protection.
Wirel. Commun. Mob. Comput., 2017

An FPTAS for the parallel two-stage flowshop problem.
Theor. Comput. Sci., 2017

Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72].
Theor. Comput. Sci., 2017

Approximation for vertex cover in β-conflict graphs.
J. Comb. Optim., 2017

Cooperative adaptive cruise control of connected and autonomous vehicles subject to input saturation.
Proceedings of the 8th IEEE Annual Ubiquitous Computing, 2017

Smoothed heights of tries and patricia tries.
Theor. Comput. Sci., 2016

An energy efficient privacy-preserving content sharing scheme in mobile social networks.
Pers. Ubiquitous Comput., 2016

Machine scheduling with a maintenance interval and job delivery coordination.
Optim. Lett., 2016

The Steiner traveling salesman problem with online advanced edge blockages.
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

Improved parameterized and exact algorithms for cut problems on trees.
Theor. Comput. Sci., 2015

A 0.5358-approximation for Bandpass-2.
J. Comb. Optim., 2015

The Steiner Traveling Salesman Problem with online edge blockages.
Eur. J. Oper. Res., 2015

Isomorphism and similarity for 2-generation pedigrees.
BMC Bioinform., 2015

Approximating the maximum multiple RNA interaction problem.
Theor. Comput. Sci., 2014

Approximating the minimum independent dominating set in perturbed graphs.
Theor. Comput. Sci., 2014

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.
Theor. Comput. Sci., 2014

Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems.
Proceedings of the Theory and Applications of Models of Computation, 2014

On the Smoothed Heights of Trie and Patricia Index Trees.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Algorithms for Cut Problems on Trees.
Proceedings of the Combinatorial Optimization and Applications, 2014

An approximation algorithm for the Bandpass-2 problem.
CoRR, 2013

Approximation Algorithms for the Maximum Multiple RNA Interaction Problem.
Proceedings of the Combinatorial Optimization and Applications, 2013

An Improved Approximation Algorithm for the Bandpass Problem.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012