Algorithms for Necklace Maps
DOI10.1142/S021819591550003XzbMATH Open1341.68300OpenAlexW1146533735WikidataQ59782235 ScholiaQ59782235MaRDI QIDQ2950591FDOQ2950591
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
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
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)
Cites Work
- The Complexity of Coloring Circular Arcs and Chords
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Boundary labeling: Models and efficient algorithms for rectangular maps
- Boundary labeling with octilinear leaders
- Coloring a Family of Circular Arcs
- Minimizing late jobs in the general one machine scheduling problem
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Algorithmic aspects of proportional symbol maps
- Finding the largest suborder of fixed width
- Minimizing setups in ordered sets of fixed width
- Revisiting Tucker's Algorithm to Color Circular Arc Graphs
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
- Title not available (Why is that?)
- 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)
