Optimization problems in multiple-interval graphs
From MaRDI portal
maximum cliqueapproximation algorithmsminimum vertex coverminimum dominating setmultiple-interval graphs
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cited in
(32)- Online selection of intervals and t-intervals
- Recognizing unit multiple intervals is hard
- Optimization problems in dotted interval graphs
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy
- Multistage graph problems on a global budget
- Optimization problems in multiple subtree graphs
- Optimization problems in multiple subtree graphs
- Optimality program in segment and string graphs
- Parameterized complexity in multiple-interval graphs: domination
- Temporal interval cliques and independent sets
- Approximability and parameterized complexity of multicover by \(c\)-intervals
- On dominating set of some subclasses of string graphs
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Generalized vertex covering in interval graphs
- Algorithms for intersection graphs for \(t\)-intervals and \(t\)-pseudodisks
- Shiftable intervals
- Generalizing Roberts' characterization of unit interval graphs
- Optimization problems in dotted interval graphs
- Approximation algorithms for intersection graphs
- Optimization problems in multiple-interval graphs
- The maximum clique problem in multiple interval graphs (extended abstract)
- Interval-parameter optimization problems on graphs
- Three ways to cover a graph
- Dominating set is fixed parameter tractable in claw-free graphs
- A graph-theoretic barcode ordering model for linked-reads
- Recognizing unit multiple interval graphs is hard
- Shiftable intervals
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
- Approximating dominating set on intersection graphs of rectangles and L-frames
- scientific article; zbMATH DE number 4179413 (Why is no real title available?)
- Mobility offer allocations in corporate settings
- Improved algorithm for resource allocation problems
This page was built for publication: Optimization problems in multiple-interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930319)
