Optimal shooting: Characterizations and applications
From MaRDI portal
Publication:4645180
DOI10.1007/3-540-60084-1_76zbMath1412.68286WikidataQ62037496 ScholiaQ62037496MaRDI QIDQ4645180
Frank Bauernöppel, Jörg-Rüdiger Sack, Jorge Urrutia, Marc Noy, Anil Maheshwari, Evangelos Kranakis, Danny Krizanc
Publication date: 10 January 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60084-1_76
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for a special case of disjoint set union
- Circle orders, n-gon orders and the crossing number
- Optimal scheduling for two-processor systems
- The Complexity of the Partial Order Dimension Problem
- On Comparability and Permutation Graphs
- Parallel Merge Sort
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
- Scheduling Graphs on Two Processors
- Lower Bounds for Approximation by Nonlinear Manifolds
- Optimal Sequencing of Two Equivalent Processors
- Regular Graphs with Given Girth and Restricted Circuits