The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- How to detect a counterfeit coin: Adaptive versus non-adaptive solutions (Q1007588) (← links)
- Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
- The complexity of computing the Muirhead-Dalton distance (Q1013525) (← links)
- The hardness of train rearrangements (Q1015300) (← links)
- Polygons with inscribed circles and prescribed side lengths (Q1021802) (← links)
- The complexity of economic equilibria for house allocation markets (Q1029018) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Threshold aggregation of multi-graded rankings (Q1042333) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- On minimizing the sum of \(k\) tardinesses (Q1178234) (← links)
- Polynomial graph-colorings (Q1183345) (← links)
- Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
- UET-scheduling with constrained processor allocations (Q1185984) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Counting convex \(k\)-gons in planar point sets (Q1190511) (← links)
- The exact LPT-bound for maximizing the minimum completion time (Q1196214) (← links)
- Detecting cycles through three fixed vertices in a graph (Q1198018) (← links)
- On the equal-subset-sum problem (Q1198083) (← links)
- Finding the closest extreme vertex to a fixed point (Q1199551) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- A heuristic for preemptive scheduling with set-up times (Q1202243) (← links)
- The complexity of finding arborescences in hypergraphs (Q1205723) (← links)
- Repacking helps in bounded space on-line bin-packing (Q1207048) (← links)
- A solvable case of the quadratic assignment problem (Q1267182) (← links)
- Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836) (← links)
- A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times (Q1268839) (← links)
- Approximation schemes for scheduling on parallel machines (Q1268852) (← links)
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs (Q1273088) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- The travelling salesman problem on permuted Monge matrices (Q1288469) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
- Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
- Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (Q1290645) (← links)
- The Steiner tree problem in Kalmanson matrices and in circulant matrices (Q1304385) (← links)
- Sensitivity analysis for knapsack problems: Another negative result (Q1304487) (← links)
- Optimal on-line algorithms for variable-sized bin covering (Q1306350) (← links)
- Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353) (← links)
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
- A comment on a minmax location problem (Q1306472) (← links)
- On-line scheduling on a single machine: Minimizing the total completion time (Q1306569) (← links)
- A tight bound for 3-partitioning (Q1309812) (← links)
- On the Euclidean two paths problem (Q1315995) (← links)
- The complexity of detecting crossingfree configurations in the plane (Q1317860) (← links)
- A new on-line scheduling heuristic (Q1319539) (← links)
- On-line scheduling of jobs with fixed start and end times (Q1331962) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Fast algorithms for the maximum convolution problem (Q1332943) (← links)
- Associativity of recurrence multiplication (Q1334832) (← links)
- A lower bound for randomized on-line scheduling algorithms (Q1336752) (← links)
