The following pages link to Guangting Chen (Q313818):
Displaying 43 items.
- Scheduling jobs with equal processing times and a single server on parallel identical machines (Q313819) (← links)
- Relay node placement in two-tiered wireless sensor networks with base stations (Q385493) (← links)
- Better permutations for the single-processor scheduling with time restrictions (Q523167) (← links)
- A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
- A constrained minimum spanning tree problem (Q1571033) (← links)
- On the NP-hardness of scheduling with time restrictions (Q1662160) (← links)
- Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks (Q1699773) (← links)
- On the largest matching roots of graphs with a given number of pendent vertices (Q1727760) (← links)
- Approximate the scheduling of quay cranes with non-crossing constraints (Q1751714) (← links)
- On the 2-MRS problem in a tree with unreliable edges (Q1790110) (← links)
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974) (← links)
- Approximation algorithms for parallel open shop scheduling (Q1943639) (← links)
- An improved algorithm for a two-stage production scheduling problem with an outsourcing option (Q2034787) (← links)
- Improved hardness and approximation results for single allocation hub location (Q2039648) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
- The web proxy location problem in general tree of rings networks (Q2385469) (← links)
- A new least square algorithm for linear programming (Q2505271) (← links)
- Improved hardness and approximation results for single allocation hub location problems (Q2661760) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- (Q2764686) (← links)
- (Q2768298) (← links)
- On the Meir-Keeler-Khan set contractions (Q2828109) (← links)
- (Q2983631) (← links)
- (Q3372777) (← links)
- (Q3538415) (← links)
- (Q4242847) (← links)
- Constrained Steiner trees in Halin graphs (Q4467896) (← links)
- (Q4542225) (← links)
- (Q4551390) (← links)
- (Q4690459) (← links)
- (Q4828493) (← links)
- (Q4980800) (← links)
- (Q5016023) (← links)
- (Q5128459) (← links)
- The largest matching roots of unicyclic graphs with a fixed matching number (Q5193373) (← links)
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges (Q5245845) (← links)
- (Q5282667) (← links)
- Combined projected gradient algorithm for linear programming (Q5481683) (← links)
- Scheduling double-track gantry cranes to minimize the overall loading/unloading time (Q6542999) (← links)
