The following pages link to On the max min vertex cover problem (Q499339):
Displaying 13 items.
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- \textsc{MAX MIN} vertex cover and the size of Betti tables (Q2660135) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- A maximum dicut in a digraph induced by a minimal dominating set (Q5090164) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Complexity of the max cut problem with the minimal domination constraint (Q5878608) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
