Maximum minimal vertex cover parameterized by vertex cover

Keyphrases

• Vertex Cover 100%
• Max Min Vertex Cover 100%
• Parameterized Complexity 75%
• Approximation Ratio 50%
• Maximization Problem 50%
• Tight 25%
• Polynomial-time Algorithm 25%
• P-NP 25%
• Time Ratio 25%
• Control Parameters 25%
• Parameterized Algorithms 25%
• User Control 25%
• Wireless Ad-hoc Networks (WANETs) 25%
• Vertex Cover Problem 25%
• Strong Exponential Time Hypothesis 25%
• Rendering Algorithm 25%
• Conditional Lower Bounds 25%
• Parameterized Approximation Algorithm 25%

Computer Science

• Approximation Ratio 100%
• Approximation Algorithms 50%
• polynomial-time algorithm 50%
• wireless ad hoc network 50%
• Rendering Algorithm 50%

Mathematics

• Minimal Vertex 100%
• Running Time 50%
• Polynomial Time 25%
• Tradeoff 25%
• Conditionals 25%
• Exponential Time 25%