Algorithms for Necklace Maps

DOI10.1142/S021819591550003XMaRDI QIDQ2950591zbMATH OpenOpenAlexWikidataFDO

Authors Bettina Speckmann, Kevin Verbeek

Publication date 9 October 2015

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/c193c651-47ca-4acb-8f2a-c2dba276ce20

zbMATH Keywords

schedulingautomated cartographynecklace maps

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1305469
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• A fast algorithm to generate necklaces with fixed content
• Algorithms for Greechie diagrams
• AN ALGORITHM TO CONSTRUCT THE LE DIAGRAM ASSOCIATED TO A GRASSMANN NECKLACE
• Simplotopal maps and necklace splitting
• Necklaces and convex \(k\)-gons
• scientific article; zbMATH DE number 1263424
• Publication:4952625

Cites work

• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• Algorithmic aspects of proportional symbol maps
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Boundary labeling with octilinear leaders
• Boundary labeling: Models and efficient algorithms for rectangular maps
• Coloring a Family of Circular Arcs
• Finding the largest suborder of fixed width
• Minimizing late jobs in the general one machine scheduling problem
• Minimizing setups in ordered sets of fixed width
• Revisiting Tucker's Algorithm to Color Circular Arc Graphs
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• The Complexity of Coloring Circular Arcs and Chords

Cited in

(8)

• Simplotopal maps and necklace splitting
• A fast algorithm to generate necklaces with fixed content
• Algorithmic aspects of proportional symbol maps
• Algorithmic Aspects of Proportional Symbol Maps
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
• scientific article; zbMATH DE number 1305469 (Why is no real title available?)
• Necklaces, convolutions, and \(X+Y\)

This page was built for publication: Algorithms for Necklace Maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950591)