scientific article; zbMATH DE number 2119734
From MaRDI portal
Recommendations
- Scheduling Split Intervals
- Scheduling split intervals with non-uniform demands
- Split scheduling with uniform setup times
- Scheduling dyadic intervals
- Splitting intervals
- Splitting intervals
- Multitasking scheduling with alternate periods
- Interval Analysis in Scheduling
- Publication:3128889
- Online scheduling of splittable tasks
Cited in
(36)- On the computational complexity of 2-interval pattern matching problems
- Hardness of approximation for non-overlapping local alignments.
- scientific article; zbMATH DE number 2080249 (Why is no real title available?)
- Extracting constrained 2-interval subsets in 2-interval sets
- Designing optimally multiplexed SNP genotyping assays
- A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
- Improved algorithms for largest cardinality 2-interval pattern problem
- Combination of parallel machine scheduling and vertex cover
- Packing in honeycomb networks
- Two-machine interval shop scheduling with time lags
- Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
- Parameterized complexity of two-interval pattern problem
- Admission control with advance reservations in simple networks
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- Online splitting interval scheduling on \(m\) identical machines
- Algorithms – ESA 2005
- Interval selection: Applications, algorithms, and lower bounds
- Using fractional primal-dual to schedule split intervals with demands
- Optimization problems in multiple subtree graphs
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
- Scheduling dyadic intervals
- Improved Algorithms for Several Parameterized Problems Based on Random Methods
- Consistent sets of secondary structures in proteins
- Approximating interval selection on unrelated machines with unit-length intervals and cores
- Strip Graphs: Recognition and Scheduling
- Spectrum Bidding in Wireless Networks and Related
- Complexity issues in color-preserving graph embeddings
- On the parameterized complexity of multiple-interval graph problems
- Split scheduling with uniform setup times
- An efficient approximation for the generalized assignment problem
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths
- Scheduling with conflicts on bipartite and interval graphs
- Scheduling split intervals with non-uniform demands
- Scheduling Split Intervals
- Approximating the 2-interval pattern problem
- Looking at the stars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829009)
