The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey (Q4210360) (← links)
- (Q4228496) (← links)
- (Q4234139) (← links)
- (Q4247460) (← links)
- (Q4252304) (← links)
- (Q4252357) (← links)
- (Q4252365) (← links)
- (Q4254354) (← links)
- (Q4269395) (← links)
- (Q4274209) (← links)
- (Q4281629) (← links)
- (Q4284253) (← links)
- (Q4291430) (← links)
- Improved Space for Bounded-Space, On-Line Bin-Packing (Q4302269) (← links)
- (Q4311199) (← links)
- (Q4331306) (← links)
- The disjoint cliques problem (Q4345417) (← links)
- Three easy special cases of the euclidean travelling salesman problem (Q4372111) (← links)
- Greedy Algorithms for On-Line Data Compression (Q4373003) (← links)
- (Q4373668) (← links)
- Sometimes Travelling is Easy: The Master Tour Problem (Q4388980) (← links)
- (Q4394600) (← links)
- (Q4411360) (← links)
- (Q4411417) (← links)
- (Q4411420) (← links)
- (Q4414481) (← links)
- (Q4414486) (← links)
- (Q4414647) (← links)
- Squares from Products of Consecutive Integers (Q4417735) (← links)
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (Q4427320) (← links)
- An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine (Q4427378) (← links)
- (Q4427859) (← links)
- (Q4448764) (← links)
- (Q4448768) (← links)
- (Q4459105) (← links)
- Minimum-cost dynamic flows: The series-parallel case (Q4474291) (← links)
- (Q4535070) (← links)
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
- On-line and off-line approximation algorithms for vector covering problems (Q4595502) (← links)
- Fine-grained complexity analysis of two classic TSP variants (Q4598137) (← links)
- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases (Q4645924) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- Radio Labeling with Preassigned Frequencies (Q4651992) (← links)
- (Q4659605) (← links)
- (Q4668722) (← links)
- Minimizing the weighted number of late jobs in UET open shops (Q4698122) (← links)
- Note: Open-shop scheduling with release dates to minimize maximum lateness (Q4698134) (← links)
- (Q4793089) (← links)
- (Q4796169) (← links)
- (Q4796173) (← links)
