Algorithms for Necklace Maps
DOI10.1142/s021819591550003xzbMath1341.68300OpenAlexW1146533735WikidataQ59782235 ScholiaQ59782235MaRDI QIDQ2950591
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
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Finding the largest suborder of fixed width
- Minimizing setups in ordered sets of fixed width
- Boundary labeling: Models and efficient algorithms for rectangular maps
- Boundary labeling with octilinear leaders
- 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
- Algorithmic aspects of proportional symbol maps
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- The Complexity of Coloring Circular Arcs and Chords
- Coloring a Family of Circular Arcs
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Revisiting Tucker's Algorithm to Color Circular Arc Graphs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: Algorithms for Necklace Maps
