The following pages link to Randy Goebel (Q300232):
Displaying 43 items.
- Approximating the maximum multiple RNA interaction problem (Q300233) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- An improved approximation algorithm for the complementary maximal strip recovery problem (Q439932) (← links)
- A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
- Machine scheduling with a maintenance interval and job delivery coordination (Q518131) (← links)
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders (Q1036927) (← links)
- The ECO family (Q1202626) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974) (← links)
- A local search 4/3-approximation algorithm for the minimum 3-path partition problem (Q2091113) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Rescheduling due to machine disruption to minimize the total weighted completion time (Q2317133) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem (Q2327083) (← links)
- An improved approximation algorithm for the minimum 3-path partition problem (Q2424798) (← links)
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← 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)
- Strong Equivalence of Logic Programs with Abstract Constraint Atoms (Q3003252) (← links)
- An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q3004655) (← links)
- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination (Q3452556) (← links)
- Speculative Abductive Reasoning for Hierarchical Agent Systems (Q3582735) (← links)
- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem (Q3637083) (← links)
- (Q3747756) (← links)
- (Q3830553) (← links)
- (Q4012205) (← links)
- (Q4217934) (← links)
- (Q4224292) (← links)
- An abductive approach to disjunctive logic programming (Q4484725) (← links)
- (Q4535571) (← links)
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
- (Q4739201) (← links)
- Approximating the Minimum Independent Dominating Set in Perturbed Graphs (Q4925243) (← links)
- (Q4944874) (← links)
- A 21/16-Approximation for the Minimum 3-Path Partition Problem (Q5875609) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919645) (← links)
