scientific article
From MaRDI portal
Publication:4036610
zbMath0772.68043MaRDI QIDQ4036610
R. Ravi, Ajit Agrawal, Philip N. Klein
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationsingle-processor schedulinginterval graph completionpolyomial time approximation algorithms
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (15)
\(\ell ^2_2\) spreading metrics for vertex ordering problems ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Precedence constrained scheduling to minimize sum of weighted completion times on a single machine ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ Minimal cutwidth linear arrangements of abelian Cayley graphs ⋮ An optimal time algorithm for minimum linear arrangement of chord graphs ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ On the interval completion of chordal graphs ⋮ Complexity classification of some edge modification problems ⋮ Node set optimization problem for complete Josephus cubes ⋮ A branch and bound algorithm for the minimum storage-time sequencing problem ⋮ Parameterized algorithmics for linear arrangement problems ⋮ Minimum linear arrangement of chord graphs ⋮ Experiments on the minimum linear arrangement problem ⋮ Minimum fill-in: inapproximability and almost tight lower bounds
This page was built for publication:
