Scheduling Split Intervals
From MaRDI portal
Recommendations
Cited in
(59)- On recovering syntenic blocks from comparative maps
- Winner determination in geometrical combinatorial auctions
- Competitive algorithms for multistage online scheduling
- Scheduling dyadic intervals
- Parameterized complexity of two-interval pattern problem
- Interval scheduling with economies of scale
- Online scheduling of car-sharing request pairs between two locations
- On independent set in \(B_1\)-EPG graphs
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- Scheduling split intervals with non-uniform demands
- Computing inductive vertex orderings
- On tree-constrained matchings and generalizations
- Split scheduling with uniform setup times
- The maximum clique problem in multiple interval graphs
- On edge intersection graphs of paths with 2 bends
- Recognizing d-interval graphs and d-track interval graphs
- Maximal strip recovery problem with gaps: hardness and approximation algorithms
- Dealing with several parameterized problems by random methods
- Parameterized complexity in multiple-interval graphs: domination
- An improved approximation algorithm for the complementary maximal strip recovery problem
- Iterative packing for demand and hypergraph matching
- On tree-constrained matchings and generalizations
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- Generalized hypergraph matching via iterated packing and local ratio
- Online selection of intervals and t-intervals
- Optimization problems in dotted interval graphs
- Partial multicovering and the d-consecutive ones property
- The interval ordering problem
- Exact and approximation algorithms for the complementary maximal strip recovery problem
- An improved approximation algorithm for the complementary maximal strip recovery problem
- scientific article; zbMATH DE number 2080249 (Why is no real title available?)
- Approximation algorithms for intersection graphs
- scientific article; zbMATH DE number 2119734 (Why is no real title available?)
- A retrospective on genomic preprocessing for comparative genomics
- Fast diameter computation within split graphs
- The fullerene graphs with a perfect star packing
- Interval scheduling maximizing minimum coverage
- Optimization problems in multiple subtree graphs
- Algorithms – ESA 2005
- On Recovering Syntenic Blocks from Comparative Maps
- Inapproximability of maximal strip recovery
- Minimum vertex cover in rectangle graphs
- Temporal interval cliques and independent sets
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- On streaming algorithms for geometric independent set and clique
- A graph-theoretic barcode ordering model for linked-reads
- Recognizing unit multiple interval graphs is hard
- Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
- Recognizing unit multiple intervals is hard
- Distributed fractional local ratio and independent set approximation
- On linear and semidefinite programming relaxations for hypergraph matching
- Generalizing Roberts' characterization of unit interval graphs
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Triangles improve 0.878 approximation for Maxcut
- Using fractional primal-dual to schedule split intervals with demands
- Three ways to cover a graph
This page was built for publication: Scheduling Split Intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470743)
