Pages that link to "Item:Q4606268"
From MaRDI portal
The following pages link to Beating ratio 0.5 for weighted oblivious matching problems (Q4606268):
Displayed 8 items.
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)