Donglei Du
Orcid: 0000-0003-0111-8572
According to our database1,
Donglei Du
authored at least 110 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity.
Theor. Comput. Sci., January, 2024
An approximation algorithm for high-dimensional table compression on balanced K-partite graph.
Comput. Electr. Eng., January, 2024
2023
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis.
J. Glob. Optim., November, 2023
Asia Pac. J. Oper. Res., October, 2023
Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost.
Theor. Comput. Sci., March, 2023
Online-Retail Supply Chain Optimization with Credit Period and Selling Price-Dependent Demand.
Asia Pac. J. Oper. Res., February, 2023
J. Comb. Optim., 2023
Two approximation algorithms for maximizing nonnegative weakly monotonic set functions.
J. Comb. Optim., 2023
Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint.
CoRR, 2023
2022
Theor. Comput. Sci., 2022
An improved primal-dual approximation algorithm for the k-means problem with penalties.
Math. Struct. Comput. Sci., 2022
J. Glob. Optim., 2022
J. Comb. Optim., 2022
An approximation algorithm for stochastic multi-level facility location problem with soft capacities.
J. Comb. Optim., 2022
Bicriteria streaming algorithms to balance gain and cost with cardinality constraint.
J. Comb. Optim., 2022
Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.
J. Comb. Optim., 2022
J. Comb. Optim., 2022
Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization.
CoRR, 2022
An improved approximation algorithm for maximizing a DR-submodular function over a convex set.
CoRR, 2022
Proceedings of the Theory and Applications of Models of Computation, 2022
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022
2021
Bicriteria algorithms to balance coverage and cost in team formation under online model.
Theor. Comput. Sci., 2021
J. Optim. Theory Appl., 2021
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint.
J. Glob. Optim., 2021
J. Comb. Optim., 2021
Asia Pac. J. Oper. Res., 2021
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2021
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021
A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions.
Proceedings of the Combinatorial Optimization and Applications, 2021
Proceedings of the Algorithmic Aspects in Information and Management, 2021
2020
Proceedings of the Theory and Applications of Models of Computation, 2020
Proceedings of the Theory and Applications of Models of Computation, 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
Improved approximation algorithm for universal facility location problem with linear penalties.
Theor. Comput. Sci., 2019
Optim. Lett., 2019
Optim. Lett., 2019
Optim. Lett., 2019
Approximation algorithm for squared metric facility location problem with nonuniform capacities.
Discret. Appl. Math., 2019
Approximation algorithms for the fault-tolerant facility location problem with penalties.
Discret. Appl. Math., 2019
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019
2018
An approximation algorithm for the <i>k</i>-median problem with uniform penalties via pseudo-solution.
Theor. Comput. Sci., 2018
Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain.
J. Glob. Optim., 2018
Approximation algorithms for precedence-constrained identical machine scheduling with rejection.
J. Comb. Optim., 2018
An approximation algorithm for k-facility location problem with linear penalties using local search scheme.
J. Comb. Optim., 2018
J. Comb. Optim., 2018
A local search approximation algorithm for the uniform capacitated k-facility location problem.
J. Comb. Optim., 2018
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018
2017
An approximation algorithm for the nth power metric facility location problem with linear penalties.
Optim. Lett., 2017
Local search algorithm for universal facility location problem with linear penalties.
J. Glob. Optim., 2017
Incorporating Positional Information into Deep Belief Networks for Sentiment Classification.
Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2017
2016
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique.
Theor. Comput. Sci., 2016
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding.
J. Comb. Optim., 2016
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016
An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions.
Proceedings of the Combinatorial Optimization and Applications, 2016
Proceedings of the Advances in Artificial Intelligence, 2016
2015
Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach.
Theor. Comput. Sci., 2015
On-line preemptive machine scheduling with ℓ<sub>p</sub> norm on two uniform machines.
J. Sched., 2015
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines.
Theory Comput. Syst., 2015
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems.
J. Comb. Optim., 2015
Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties.
Algorithmica, 2015
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015
A (5.83 + ϵ)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties.
Proceedings of the Combinatorial Optimization and Applications, 2015
Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties.
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems.
J. Comb. Optim., 2014
A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties.
J. Comb. Optim., 2014
Technical Note - A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula.
Oper. Res., 2014
Sci. China Inf. Sci., 2014
Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014
A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014
2013
A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties.
Theor. Comput. Sci., 2013
Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
Improved approximation algorithms for the robust fault-tolerant facility location problem.
Inf. Process. Lett., 2012
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties.
Algorithmica, 2012
2011
Erratum to: "An approximation algorithm for the k-level stochastic facility location problem" [Oper. Res. Lett. 38(2010) 386-389].
Oper. Res. Lett., 2011
2010
Oper. Res. Lett., 2010
An approximation algorithm for the <i>k</i>-level capacitated facility location problem.
J. Comb. Optim., 2010
A Primal-Dual Approximation Algorithm for the <i>k</i>-Level Stochastic Facility Location Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2010
2009
Eur. J. Oper. Res., 2009
2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the l<sub>p</sub> Norm.
Proceedings of the Algorithmic Aspects in Information and Management, 2008
2007
Networks, 2007
Proceedings of the Combinatorics, 2007
2006
Oper. Res. Lett., 2006
J. Parallel Distributed Comput., 2006
2004
Inf. Process. Lett., 2004
Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, 2004
2001
1998