Optimization problems in multiple-interval graphs
From MaRDI portal
Publication:2930319
DOI10.1145/1721837.1721856zbMath1300.05295OpenAlexW2106322572MaRDI QIDQ2930319
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1721837.1721856
No records found.
No records found.
Related Items (14)
Parameterized Complexity in Multiple-Interval Graphs: Domination ⋮ On dominating set of some subclasses of string graphs ⋮ Online selection of intervals and \(t\)-intervals ⋮ Hardness and approximation for L-EPG and \(B_1\)-EPG graphs ⋮ Temporal interval cliques and independent sets ⋮ Optimization problems in dotted interval graphs ⋮ Mobility offer allocations in corporate settings ⋮ Three ways to cover a graph ⋮ Improved Algorithm for Resource Allocation Problems ⋮ Dominating set is fixed parameter tractable in claw-free graphs ⋮ Approximation algorithms for intersection graphs ⋮ Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames ⋮ Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy ⋮ Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
This page was built for publication: Optimization problems in multiple-interval graphs
