scientific article

From MaRDI portal

Revision as of 14:31, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2768284

Jump to:navigation, search

zbMath0989.90023MaRDI QIDQ2768284

Esther M. Arkin, Erik D. Demaine, Saurabh Sethia, Joseph S. B. Mitchell, Sándor P. Fekete, Michael A. Bender

Publication date: 24 March 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

covering manufacturing traveling salesman problem approximation algorithms polynomial-time approximation scheme milling NC machining \(m\)-guillotinge subdivisions lawn moving

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (5)

Online searching with turn cost ⋮ Taming the knight's tour: minimizing turns and crossings ⋮ Minimum Scan Cover with Angular Transition Costs ⋮ Approximation algorithms for lawn mowing and milling ⋮ Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2768284&oldid=15645130"