On Some Variants of the Bandwidth Minimization Problem
From MaRDI portal
Recommendations
Cited in
(50)- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Antibandwidth of complete \(k\)-ary trees
- Computing the bump number with techniques from two-processor scheduling
- Fixed hypercube embedding
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Scheduling real-time computations with separation constraints
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Bandwidth contrained NP-complete problems
- Scheduling dyadic intervals
- A note on computational approaches for the antibandwidth problem
- Optimizing consolidation processes in hubs: the hub-arrival-departure problem
- A general variable neighborhood search for the cyclic antibandwidth problem
- A metric approach for scheduling problems with minimizing the maximum penalty
- The complexity of graph languages generated by hyperedge replacement
- Contrast in greyscales of graphs
- The maximum \(k\)-differential coloring problem
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- Cyclic bandwidth with an edge added
- Lower bounds for the bandwidth problem
- Antibandwidth and cyclic antibandwidth of Hamming graphs
- GRASP with path relinking heuristics for the antibandwidth problem
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- scientific article; zbMATH DE number 3854443 (Why is no real title available?)
- Tabu search for the cyclic bandwidth problem
- The Cyclic Antibandwidth Problem
- Antibandwidth of Complete k-Ary Trees
- Antibandwidth of Three-Dimensional Meshes
- The Effective Bandwidth Problem Revisited
- On circular layouts∗
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- A special antidilation problem for meshes and Hamming graphs
- scientific article; zbMATH DE number 1778090 (Why is no real title available?)
- A note on maximum differential coloring of planar graphs
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- Algorithmic uses of the Feferman-Vaught theorem
- Deep two-way matrix reordering for relational data analysis
- Minimum gradation in greyscales of graphs
- Population-based iterated greedy algorithm for the S-labeling problem
- Memetic algorithm for the antibandwidth maximization problem
- Two models of two-dimensional bandwidth problems
- A multi-start variable neighborhood tabu search algorithm for the cyclic bandwidth problem
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- Single machine scheduling with precedence constraints and bounded maximum delay value
- A double-stage heuristic algorithm for the antibandwidth maximization problem via the linear bottleneck assignment optimization
- The parameterized complexity of scheduling with precedence delays: shuffle product and directed bandwidth
- The connection between the bump number problem and flow-shop scheduling with precedence constraints
- Separation numbers of trees
- The complexity of finding uniform emulations on paths and ring networks
- Antibandwidth of three-dimensional meshes
This page was built for publication: On Some Variants of the Bandwidth Minimization Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335004)
