Pages that link to "Item:Q4645918"

The following pages link to Approximating k-set cover and complementary graph coloring (Q4645918):

Displaying 12 items.

• On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
• Dual parameterization of weighted coloring (Q786042) (← links)
• Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
• Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
• The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
• Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks (Q1662465) (← links)
• Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
• A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
• A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
• Dual parameterization of Weighted Coloring (Q5009474) (← links)
• Approximation algorithms and hardness results for the clique packing problem (Q5900079) (← links)
• Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)