scientific article
From MaRDI portal
Publication:2921679
zbMath1297.05174MaRDI QIDQ2921679
Miroslav Chlebík, Janka Chlebíková
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Temporal interval cliques and independent sets ⋮ Scheduling split intervals with non-uniform demands ⋮ Competitive algorithms for multistage online scheduling ⋮ Minimum vertex cover in rectangle graphs
This page was built for publication:
