The following pages link to Dong-lei Du (Q591600):
Displaying 25 items.
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- An almost tight lower bound for the scheduling problem to meet two min-sum objectives (Q384219) (← links)
- Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
- An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
- An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← links)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
- Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
- A cost-sharing method for the multi-level economic lot-sizing game (Q893607) (← links)
- Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
- Third-order extensions of Lo's semiparametric bound for European call options (Q1026788) (← links)
- On the effects of risk pooling in supply chain management: review and extensions (Q1048256) (← links)
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain (Q1753138) (← links)
- Stochastic Variance Reduction for DR-Submodular Maximization (Q6492081) (← links)
- Differentially private submodular maximization with a cardinality constraint over the integer lattice (Q6495887) (← links)
