Pages that link to "Item:Q1311585"
From MaRDI portal
The following pages link to The boundaries of submodular functions (Q1311585):
Displaying 6 items.
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)
- On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)
