An improved approximation algorithm for the partial Latin square extension problem.
From MaRDI portal
Recommendations
- On Completing Latin Squares
- Approximating latin square extensions
- An approximation algorithm for the partial covering 0-1 integer program
- An efficient local search for partial Latin square extension problem
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
Cites work
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- Approximating latin square extensions
- Clique partitions, graph compression and speeding-up algorithms
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Geometric algorithms and combinatorial optimization.
- Latin squares. New developments in the theory and applications
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Open Shop Scheduling to Minimize Finish Time
- The complexity of completing partial Latin squares
Cited in
(6)- On residual approximation in solution extension problems
- An efficient local search for partial Latin square extension problem
- A massively parallel evolutionary algorithm for the partial Latin square extension problem
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
- Approximating latin square extensions
- On Completing Latin Squares
This page was built for publication: An improved approximation algorithm for the partial Latin square extension problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703265)
