Optimal shooting: Characterizations and applications

DOI10.1007/3-540-60084-1_76MaRDI QIDQ4645180zbMATH OpenOpenAlexWikidataFDO

Authors Frank Bauernöppel, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, J. Urrutia, Evangelos Kranakis, D. 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

zbMATH Keywords

comparability graphcomplete bipartite graphpermutation graphschedule problemstage number

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A linear-time algorithm for a special case of disjoint set union
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Circle orders, n-gon orders and the crossing number
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 3526713 (Why is no real title available?)
• scientific article; zbMATH DE number 3451870 (Why is no real title available?)
• scientific article; zbMATH DE number 6157247 (Why is no real title available?)
• scientific article; zbMATH DE number 1414306 (Why is no real title available?)
• scientific article; zbMATH DE number 3258081 (Why is no real title available?)
• Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
• Lower Bounds for Approximation by Nonlinear Manifolds
• On Comparability and Permutation Graphs
• Optimal scheduling for two-processor systems
• Optimal Sequencing of Two Equivalent Processors
• Parallel Merge Sort
• Regular Graphs with Given Girth and Restricted Circuits
• Scheduling Graphs on Two Processors
• The Complexity of the Partial Order Dimension Problem

Cited in

(1)

• Stage-graph representations

This page was built for publication: Optimal shooting: Characterizations and applications

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