Pages that link to "Item:Q2941530"
From MaRDI portal
The following pages link to Hardness of Graph Pricing Through Generalized Max-Dicut (Q2941530):
Displaying 7 items.
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Graph pricing with limited supply (Q832882) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- From weak to strong linear programming gaps for all constraint satisfaction problems (Q4568111) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- (Q5414632) (← links)
- Fitting metrics and ultrametrics with minimum disagreements (Q6670352) (← links)