The following pages link to Dong-lei Du (Q591600):
Displaying 50 items.
- (Q187119) (redirect page) (← links)
- 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)
- (Q489119) (redirect page) (← 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)
- Approximation of dense-\(\frac n2\)-subgraph and table compression problems (Q882965) (← 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)
- Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
- An improved heuristic for one-machine scheduling with delays constraints (Q1373850) (← links)
- A hashing power allocation game in cryptocurrencies (Q1617668) (← 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)
- A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties (Q1945937) (← links)
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
- An improved per-scenario bound for the two-stage stochastic facility location problem (Q2018918) (← links)
- Online bicriteria algorithms to balance coverage and cost in team formation (Q2039641) (← links)
- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs (Q2039649) (← links)
- The spherical \(k\)-means++ algorithm via local search (Q2039652) (← links)
- Online BP functions maximization (Q2039657) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- Pricing decisions in dual-channel closed-loop supply chain under retailer's risk aversion and fairness concerns (Q2059173) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
- An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
- The spherical \(k\)-means++ algorithm via local search scheme (Q2084616) (← links)
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint (Q2084653) (← links)
- Two-stage submodular maximization problem beyond non-negative and monotone (Q2110706) (← links)
- A primal-dual algorithm for Euclidean \(k\)-means problem with penalties (Q2110737) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859) (← links)
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
- Bicriteria algorithms to balance coverage and cost in team formation under online model (Q2220862) (← links)
- Online algorithms for BP functions maximization (Q2222096) (← links)
