The following pages link to Weitian Tong (Q300231):
Displaying 35 items.
- Approximating the maximum multiple RNA interaction problem (Q300233) (← links)
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
- An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
- Machine scheduling with a maintenance interval and job delivery coordination (Q518131) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- An improved approximation algorithm for the minimum common integer partition problem (Q2051801) (← links)
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Online crowdsourced truck delivery using historical information (Q2140193) (← links)
- Single-machine scheduling with job-dependent machine deterioration (Q2294893) (← links)
- A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem (Q2327083) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
- Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem'' (Q2357384) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- Approximation Algorithms for the Maximum Multiple RNA Interaction Problem (Q2867107) (← links)
- An Improved Approximation Algorithm for the Bandpass Problem (Q2898009) (← links)
- On the Smoothed Heights of Trie and Patricia Index Trees (Q2920448) (← links)
- Algorithms for Cut Problems on Trees (Q2942406) (← links)
- An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem (Q2942641) (← links)
- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination (Q3452556) (← links)
- (Q4636539) (← links)
- A 21/16-Approximation for the Minimum 3-Path Partition Problem (Q5875609) (← links)
- Online \(k\)-color spanning disk problems (Q6053966) (← links)
