The following pages link to Guo-Hui Lin (Q166205):
Displayed 50 items.
- (Q225404) (redirect page) (← links)
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- Approximating the maximum multiple RNA interaction problem (Q300233) (← links)
- (Q319008) (redirect page) (← 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)
- Solving haplotype inference problem with non-genotyped founders via integer linear programming (Q434198) (← links)
- Exact and approximation algorithms for the complementary maximal strip recovery problem (Q437065) (← links)
- An improved approximation algorithm for the complementary maximal strip recovery problem (Q439932) (← 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)
- On the bandpass problem (Q543512) (← links)
- An approximation algorithm for the minimum co-path set problem (Q547306) (← links)
- The three column bandpass problem is solvable in linear time (Q620937) (← links)
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
- 3-partitioning problems for maximizing the minimum load (Q702354) (← links)
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments (Q724122) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors (Q845860) (← links)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- Competitive algorithms for unbounded one-way trading (Q897958) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders (Q1036927) (← links)
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem (Q1040584) (← links)
- Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
- The exact bound of Lee's MLPT (Q1130187) (← links)
- Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times (Q1271384) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times (Q1355924) (← links)
- On minimum-weight \(k\)-edge connected Steiner networks on metric spaces (Q1586581) (← links)
- Decision tree complexity of graph properties with dimension at most 5 (Q1587333) (← links)
- Single machine scheduling with job delivery to multiple customers (Q1617286) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- A further improved approximation algorithm for breakpoint graph decomposition (Q1768609) (← links)
- Clustering binary oligonucleotide fingerprint vectors for DNA clone classification analysis (Q1781804) (← links)
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974) (← links)
- An approximation framework for bounded facility location problems (Q1790991) (← links)
- On the terminal Steiner tree problem. (Q1853109) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Methods for reconstructing the history of tandem repeats and their application to the human genome. (Q1872719) (← links)
- Approximation algorithms for NMR spectral peak assignment. (Q1874392) (← links)
- A space-efficient algorithm for sequence alignment with inversions and reversals (Q1884840) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)