The linear arrangement problem parameterized above guaranteed value
From MaRDI portal
Publication:2464326
DOI10.1007/s00224-007-1330-6zbMath1148.68039arXivcs/0511030OpenAlexW1992976178MaRDI QIDQ2464326
Anders Yeo, Arash Rafiey, Gregory Gutin, Stefan Szeider
Publication date: 19 December 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0511030
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (21)
A faster fixed parameter algorithm for two-layer crossing minimization ⋮ The \(S\)-\textsc{labeling} problem: an algorithmic tour ⋮ Parameterized and approximation algorithms for the load coloring problem ⋮ Note on maximal bisection above tight lower bound ⋮ Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value ⋮ Detours in directed graphs ⋮ Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables ⋮ Minimum Leaf Out-Branching Problems ⋮ A probabilistic approach to problems parameterized above or below tight bounds ⋮ Solving MAX-\(r\)-SAT above a tight lower bound ⋮ Betweenness parameterized above tight lower bound ⋮ Going Far from Degeneracy ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ Note on Max Lin-2 above average ⋮ Fixed-parameter complexity of minimum profile problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear kernels and linear-time algorithms for finding large cuts ⋮ Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment ⋮ Minimum leaf out-branching and related problems ⋮ A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
This page was built for publication: The linear arrangement problem parameterized above guaranteed value
