Dachuan Xu
Orcid: 0000000278460969Affiliations:
 Beijing University of Technology, China
According to our database^{1},
Dachuan Xu
authored at least 167 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
J. Comb. Optim., July, 2024
Differentially private submodular maximization with a cardinality constraint over the integer lattice.
J. Comb. Optim., May, 2024
Ann. Oper. Res., May, 2024
Algorithmica, May, 2024
SpatialTemporal Evolution Characteristics Analysis of Color Steel Buildings in Lanzhou City.
ISPRS Int. J. Geo Inf., 2024
SPABA: A SingleLoop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity.
CoRR, 2024
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
Proceedings of the Theory and Applications of Models of Computation, 2024
Proceedings of the ThirtyEighth AAAI Conference on Artificial Intelligence, 2024
2023
J. Glob. Optim., November, 2023
J. Parallel Distributed Comput., September, 2023
Math. Program., May, 2023
Asia Pac. J. Oper. Res., February, 2023
Asia Pac. J. Oper. Res., February, 2023
Comput. Electr. Eng., January, 2023
Theor. Comput. Sci., 2023
J. Comb. Optim., 2023
Two approximation algorithms for maximizing nonnegative weakly monotonic set functions.
J. Comb. Optim., 2023
Continuous Nonmonotone DRsubmodular Maximization with Downclosed Convex Constraint.
CoRR, 2023
Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions.
Concurr. Comput. Pract. Exp., 2023
Analysis of the Distribution Characteristics and Influencing Factors of Advertising Billboards in Wuhan.
Proceedings of the 7th ACM SIGSPATIAL Workshop on Locationbased Recommendations, 2023
Proceedings of the Computing and Combinatorics  29th International Conference, 2023
Proceedings of the Computing and Combinatorics  29th International Conference, 2023
2022
Oper. Res. Lett., 2022
Optim. Lett., 2022
An improved primaldual approximation algorithm for the kmeans problem with penalties.
Math. Struct. Comput. Sci., 2022
Maximization problems of balancing submodular relevance and supermodular diversity.
J. Glob. Optim., 2022
J. Comb. Optim., 2022
Bicriteria streaming algorithms to balance gain and cost with cardinality constraint.
J. Comb. Optim., 2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
Approximation guarantees for parallelized maximization of monotone nonsubmodular function with a cardinality constraint.
J. Comb. Optim., 2022
J. Comb. Optim., 2022
The provably good parallel seeding algorithms for the kmeans problem with penalties.
Int. Trans. Oper. Res., 2022
ρ/(1ε)approximate pure Nash equilibria algorithms for weighted congestion games and their runtimes.
CoRR, 2022
An improved approximation algorithm for maximizing a DRsubmodular function over a convex set.
CoRR, 2022
CoRR, 2022
CoRR, 2022
Sci. China Inf. Sci., 2022
Proceedings of the Computing and Combinatorics  28th International Conference, 2022
Proceedings of the Computing and Combinatorics  28th International Conference, 2022
2021
Parallelized maximization of nonsubmodular function subject to a cardinality constraint.
Theor. Comput. Sci., 2021
Approximation algorithms for spherical <i>k</i>means problem using local search scheme.
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Approximation algorithms for the dynamic <i>k</i>level facility location problems.
Theor. Comput. Sci., 2021
Bicriteria algorithms to balance coverage and cost in team formation under online model.
Theor. Comput. Sci., 2021
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint.
Theor. Comput. Sci., 2021
An approximation algorithm for the klevel facility location problem with outliers.
Optim. Lett., 2021
J. Comb. Optim., 2021
J. Comb. Optim., 2021
Oper. Res., 2021
A BranchandPrice Algorithm for Facility Location with General Facility Cost Functions.
INFORMS J. Comput., 2021
Discret. Appl. Math., 2021
Streaming Algorithms for Maximizing Monotone DRSubmodular Functions with a Cardinality Constraint on the Integer Lattice.
Asia Pac. J. Oper. Res., 2021
Asia Pac. J. Oper. Res., 2021
MinSum Movement of Barrier and Target Coverage using Sinkbased Mobile Sensors on the Plane.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 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
Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functions.
Proceedings of the Computational Data and Social Networks  10th International Conference, 2021
Proceedings of the Algorithmic Aspects in Information and Management, 2021
Proceedings of the ThirtyFifth AAAI Conference on Artificial Intelligence, 2021
THOR, Tracebased Hardwaredriven LayerOriented Natural Gradient Descent Computation.
Proceedings of the ThirtyFifth AAAI Conference on Artificial Intelligence, 2021
2020
Theor. Comput. Sci., 2020
M<sup><i>p</i></sup>UFLP: Universal facility location problem in the <i>p</i>th power of metric space.
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
A general method of active friending in different diffusion models in social networks.
Soc. Netw. Anal. Min., 2020
Optim. Methods Softw., 2020
Streaming algorithm for maximizing a monotone nonsubmodular function under dknapsack constraint.
Optim. Lett., 2020
J. Glob. Optim., 2020
J. Glob. Optim., 2020
J. Comb. Optim., 2020
J. Comb. Optim., 2020
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
CoRR, 2020
Asia Pac. J. Oper. Res., 2020
Proceedings of the Theory and Applications of Models of Computation, 2020
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint.
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 Parallel and Distributed Computing, Applications and Technologies, 2020
An Adaptive Algorithm for Maximization of Nonsubmodular Function with a Matroid Constraint.
Proceedings of the Computational Data and Social Networks  9th International Conference, 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
Approximation Algorithm for the Balanced 2correlation Clustering Problem on WellProportional Graphs.
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
Efficient approximation algorithms for maximum coverage with group budget constraints.
Theor. Comput. Sci., 2019
An approximation algorithm for the dynamic facility location problem with outliers.
Optim. Lett., 2019
Optim. Lett., 2019
Local search approximation algorithms for the sum of squares facility location problems.
J. Glob. Optim., 2019
Convergence and correctness of belief propagation for the Chinese postman problem.
J. Glob. Optim., 2019
Approximation algorithm for squared metric twostage stochastic facility location problem.
J. Comb. Optim., 2019
J. Comb. Optim., 2019
Approximation algorithm for squared metric facility location problem with nonuniform capacities.
Discret. Appl. Math., 2019
Approximation algorithms for the faulttolerant facility location problem with penalties.
Discret. Appl. Math., 2019
Approximating Robust Parameterized Submodular Function Maximization in LargeScales.
Asia Pac. J. Oper. Res., 2019
Asia Pac. J. Oper. Res., 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions.
Proceedings of the Optimization of Complex Systems: Theory, 2019
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019
Approximation Algorithm for the Squared Metric Soft Capacitated Facility Location Problem (Extended Abstract).
Proceedings of the Computational Data and Social Networks  8th International Conference, 2019
Greedy Algorithm for Maximization of Nonsubmodular Functions Subject to Knapsack Constraint.
Proceedings of the Computing and Combinatorics  25th International Conference, 2019
Proceedings of the Computing and Combinatorics  25th International Conference, 2019
Proceedings of the Computing and Combinatorics  25th International Conference, 2019
Proceedings of the Computing and Combinatorics  25th International Conference, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
Approximation Algorithm for the Correlation Clustering Problem with Nonuniform Hard Constrained Cluster Sizes.
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
Theor. Comput. Sci., 2018
An approximation algorithm for the <i>k</i>median problem with uniform penalties via pseudosolution.
Theor. Comput. Sci., 2018
Optim. Lett., 2018
Solving the degreeconcentrated faulttolerant spanning subgraph problem by DC programming.
Math. Program., 2018
J. Glob. Optim., 2018
Approximation algorithms for the robust/softcapacitated 2level facility location problems.
J. Glob. Optim., 2018
Approximate efficiency and strategyproofness for moneyless mechanisms on singledipped policy domain.
J. Glob. Optim., 2018
A local search approximation algorithm for a squared metric kfacility location problem.
J. Comb. Optim., 2018
Approximation algorithms for precedenceconstrained identical machine scheduling with rejection.
J. Comb. Optim., 2018
An approximation algorithm for kfacility 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 kfacility location problem.
J. Comb. Optim., 2018
CoRR, 2018
Algorithmica, 2018
Proceedings of the Algorithmic Aspects in Information and Management, 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
Proceedings of the Computing and Combinatorics  23rd International Conference, 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primaldual technique.
Theor. Comput. Sci., 2016
Theor. Comput. Sci., 2016
Combinatorial approximation algorithms for the robust facility location problem with penalties.
J. Glob. Optim., 2016
An approximation algorithm for the balanced Max3Uncut problem using complex semidefinite programming rounding.
J. Comb. Optim., 2016
Proceedings of the Combinatorial Optimization and Applications, 2016
An Approximation Algorithm for the kMedian Problem with Uniform Penalties via PseudoSolutions.
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Primaldual approximation algorithm for the twolevel facility location problem via a dual quasigreedy approach.
Theor. Comput. Sci., 2015
Approximation algorithms for the priority facility location problem with penalties.
J. Syst. Sci. Complex., 2015
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems.
J. Comb. Optim., 2015
Asia Pac. J. Oper. Res., 2015
Asia Pac. J. Oper. Res., 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 kMedian and kFacility Location Problems with Linear Penalties.
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
Improved approximation algorithms for the maxbisection and the disjoint 2catalog segmentation problems.
J. Comb. Optim., 2014
A unified dualfitting approximation algorithm for the facility location problems with linear/submodular penalties.
J. Comb. Optim., 2014
Sci. China Inf. Sci., 2014
PrimalDual 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 Max3Uncut Problem.
Proceedings of the Computing and Combinatorics  20th International Conference, 2014
2013
A combinatorial 2.375approximation algorithm for the facility location problem with submodular penalties.
Theor. Comput. Sci., 2013
J. Glob. Optim., 2013
Inf. Process. Lett., 2013
INFORMS J. Comput., 2013
Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
2012
J. Syst. Sci. Complex., 2012
Improved approximation algorithms for the robust faulttolerant facility location problem.
Inf. Process. Lett., 2012
A PrimalDual Approximation Algorithm for the Facility Location Problem with Submodular Penalties.
Algorithmica, 2012
2011
Erratum to: "An approximation algorithm for the klevel stochastic facility location problem" [Oper. Res. Lett. 38(2010) 386389].
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 PrimalDual Approximation Algorithm for the <i>k</i>Level Stochastic Facility Location Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2010
2009
Oper. Res. Lett., 2009
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
Oper. Res. Lett., 2008
2006
Oper. Res. Lett., 2006
2003
Approximating the 2catalog segmentation problem using semidefinite programming relaxations.
Optim. Methods Softw., 2003
Improved Approximation Algorithms for MAX \frac<i>n</i>\text2DIRECTEDBISECTION and MAX \frac<i>n</i>\text2DENSESUBGRAPH.
J. Glob. Optim., 2003