Pages that link to "Item:Q3569014"
From MaRDI portal
The following pages link to Strong lower bounds on the approximability of some NPO PB-complete maximization problems (Q3569014):
Displaying 10 items.
- Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems (Q293458) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- (Q5090485) (← links)
- Structure in approximation classes (Q6085751) (← links)
