Independent sets with domination constraints
From MaRDI portal
Publication:1962033
DOI10.1016/S0166-218X(99)00124-9zbMath0939.05063WikidataQ126459136 ScholiaQ126459136MaRDI QIDQ1962033
Jan Kratochvíl, Magnús M. Halldórsson, Jan Arne Telle
Publication date: 20 March 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Shrinking maxima, decreasing costs: new online packing and covering problems ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ A Taxonomy of Perfect Domination ⋮ Spectral results on graphs with regularity constraints ⋮ Spectral results on regular graphs with \((k,\tau)\)-regular sets ⋮ On the approximability of the exemplar adjacency number problem for genomes with gene repetitions ⋮ On the parameterized complexity of compact set packing ⋮ Improved (In-)Approximability Bounds for d-Scattered Set ⋮ A fast approximation algorithm for the maximum 2-packing set problem on planar graphs ⋮ Branch and recharge: exact algorithms for generalized domination ⋮ Competitive router scheduling with structured data ⋮ Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets ⋮ Main eigenvalues and \((\kappa ,\tau )\)-regular sets ⋮ Integral graphs and \((k,\tau )\)-regular sets ⋮ An Approximation Result for Matchings in Partitioned Hypergraphs ⋮ Overflow management with self-eliminations ⋮ Overflow management with self-eliminations ⋮ Truthfulness and Approximation with Value-Maximizing Bidders ⋮ Structurally parameterized \(d\)-scattered set ⋮ Relations between (κ, τ)-regular sets and star complements ⋮ An overview of \((\kappa, \tau)\)-regular sets and their applications
Cites Work
