Pages that link to "Item:Q1962033"

The following pages link to Independent sets with domination constraints (Q1962033):

Displaying 20 items.

• Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
• On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
• Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
• Spectral results on graphs with regularity constraints (Q876307) (← links)
• Spectral results on regular graphs with \((k,\tau)\)-regular sets (Q878619) (← links)
• Main eigenvalues and \((\kappa ,\tau )\)-regular sets (Q962129) (← links)
• Integral graphs and \((k,\tau )\)-regular sets (Q962131) (← links)
• Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
• Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
• An overview of \((\kappa, \tau)\)-regular sets and their applications (Q2328081) (← links)
• Competitive router scheduling with structured data (Q2440162) (← links)
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
• An Approximation Result for Matchings in Partitioned Hypergraphs (Q2806888) (← links)
• Truthfulness and Approximation with Value-Maximizing Bidders (Q2819462) (← links)
• Relations between (κ, τ)-regular sets and star complements (Q2838735) (← links)
• A Taxonomy of Perfect Domination (Q5069690) (← links)
• Overflow management with self-eliminations (Q5918714) (← links)
• Overflow management with self-eliminations (Q5925615) (← links)
• Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632) (← links)