Dachuan Xu

Orcid: 0000-0002-7846-0969

Affiliations:
  • Beijing University of Technology, China


According to our database1, Dachuan Xu authored at least 172 papers between 2003 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Sparse loss-aware ternarization for neural networks.
Inf. Sci., 2025

2024
Differentially private k-center problems.
Optim. Lett., November, 2024

Online non-monotone diminishing return submodular maximization in the bandit setting.
J. Glob. Optim., November, 2024

Online learning under one sided σ-smooth function.
J. Comb. Optim., July, 2024

Differentially private submodular maximization with a cardinality constraint over the integer lattice.
J. Comb. Optim., May, 2024

A Stackelberg order execution game.
Ann. Oper. Res., May, 2024

Stochastic Variance Reduction for DR-Submodular Maximization.
Algorithmica, May, 2024

Spatial-Temporal Evolution Characteristics Analysis of Color Steel Buildings in Lanzhou City.
ISPRS Int. J. Geo Inf., 2024

Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
Proceedings of the Theory and Applications of Models of Computation, 2024

SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Convenience Stores Geospatial Location Optimization Analytics Using Deep Reinforcement Learning.
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Spatial Big Data and AI for Industrial Applications, 2024

Revisit the Online Facility Location Problem with Uniform Facility Cost.
Proceedings of the Algorithmic Aspects in Information and Management, 2024

Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Approximation algorithms for the individually fair k-center with outliers.
J. Glob. Optim., November, 2023

A distributed message passing algorithm for computing perfect demand matching.
J. Parallel Distributed Comput., September, 2023

A convergence analysis of the price of anarchy in atomic congestion games.
Math. Program., May, 2023

Preface.
Asia Pac. J. Oper. Res., February, 2023

Eigenvalue-Corrected Natural Gradient Based on a New Approximation.
Asia Pac. J. Oper. Res., February, 2023

Parallelized maximization of nonmonotone one-sided σ-smooth function.
Comput. Electr. Eng., January, 2023

A game-theoretic perspective of deep neural networks.
Theor. Comput. Sci., 2023

Approximation algorithms for the lower bounded correlation clustering problem.
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

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 Location-based Recommendations, 2023

The Regularized Submodular Maximization via the Lyapunov Method.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

k-Median/Means with Outliers Revisited: A Simple Fpt Approximation.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
On the population monotonicity of independent set games.
Oper. Res. Lett., 2022

Selfish bin packing under Harmonic mean cost sharing mechanism.
Optim. Lett., 2022

An improved primal-dual approximation algorithm for the k-means problem with penalties.
Math. Struct. Comput. Sci., 2022

Maximization problems of balancing submodular relevance and supermodular diversity.
J. Glob. Optim., 2022

Maximizing a monotone non-submodular function under a knapsack constraint.
J. Comb. Optim., 2022

Bicriteria streaming algorithms to balance gain and cost with cardinality constraint.
J. Comb. Optim., 2022

Improved local search algorithms for Bregman k-means and its variants.
J. Comb. Optim., 2022

The spherical k-means++ algorithm via local search scheme.
J. Comb. Optim., 2022

Approximation algorithms for two variants of correlation clustering problem.
J. Comb. Optim., 2022

The seeding algorithm for spherical k-means clustering with penalties.
J. Comb. Optim., 2022

An approximation algorithm for the uniform capacitated k-means problem.
J. Comb. Optim., 2022

Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint.
J. Comb. Optim., 2022

Preface.
J. Comb. Optim., 2022

The provably good parallel seeding algorithms for the k-means 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 DR-submodular function over a convex set.
CoRR, 2022

Maximizing Modular plus Non-monotone Submodular Functions.
CoRR, 2022

Approximate the individually fair k-center with outliers.
CoRR, 2022

Regularized two-stage submodular maximization under streaming.
Sci. China Inf. Sci., 2022

Online One-Sided Smooth Function Maximization.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set.
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

A constrained two-stage submodular maximization.
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 k-level facility location problem with outliers.
Optim. Lett., 2021

A spectral partitioning algorithm for maximum directed cut problem.
J. Comb. Optim., 2021

Sequence submodular maximization meets streaming.
J. Comb. Optim., 2021

Selfishness Need Not Be Bad.
Oper. Res., 2021

A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions.
INFORMS J. Comput., 2021

Streaming algorithms for robust submodular maximization.
Discret. Appl. Math., 2021

Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice.
Asia Pac. J. Oper. Res., 2021

Preface.
Asia Pac. J. Oper. Res., 2021

MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Approximation Algorithms for the Lower Bounded Correlation Clustering Problem.
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

Differentially Private Submodular Maximization over Integer Lattice.
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

A Game-Theoretic Analysis of Deep Neural Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

A Trace-restricted Kronecker-Factored Approximation to Natural Gradient.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

THOR, Trace-based Hardware-driven Layer-Oriented Natural Gradient Descent Computation.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Offline and online algorithms for single-minded selling problem.
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

Interaction-aware influence maximization and iterated sandwich method.
Theor. Comput. Sci., 2020

A general method of active friending in different diffusion models in social networks.
Soc. Netw. Anal. Min., 2020

Randomized mechanism design for decentralized network scheduling.
Optim. Methods Softw., 2020

Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint.
Optim. Lett., 2020

Non-submodular maximization on massive data streams.
J. Glob. Optim., 2020

The seeding algorithms for spherical k-means clustering.
J. Glob. Optim., 2020

The seeding algorithm for k-means problem with penalties.
J. Comb. Optim., 2020

Approximating the τ-relaxed soft capacitated facility location problem.
J. Comb. Optim., 2020

Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
CoRR, 2020

The Parallel Seeding Algorithm for k-Means Problem with Penalties.
Asia Pac. J. Oper. Res., 2020

Parametric Streaming Two-Stage Submodular Maximization.
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

A Primal-Dual Algorithm for Euclidean <i>k</i>-Means Problem with Penalties.
Proceedings of the Theory and Applications of Models of Computation, 2020

The Prize-Collecting k-Steiner Tree Problem.
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint.
Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

An Improved Bregman k-means++ Algorithm via Local Search.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

The Spherical k-means++ Algorithm via Local Search.
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

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

A 5-approximation algorithm for the k-prize-collecting Steiner tree problem.
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 two-stage stochastic facility location problem.
J. Comb. Optim., 2019

Local search approximation algorithms for the k-means problem with penalties.
J. Comb. Optim., 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

Approximating Robust Parameterized Submodular Function Maximization in Large-Scales.
Asia Pac. J. Oper. Res., 2019

A Streaming Algorithm for k-Means with Approximate Coreset.
Asia Pac. J. Oper. Res., 2019

A Discretization Algorithm for k-Means with Capacity Constraints.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Scheduling Three Identical Parallel Machines with Capacity Constraints.
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

Streaming Submodular Maximization Under Noises.
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 Non-submodular Functions Subject to Knapsack Constraint.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Maximization of Constrained Non-submodular Functions.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Universal Facility Location in Generalized Metric Space.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

The Seeding Algorithm for Functional k-Means Problem.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Local Search Approximation Algorithms for the Spherical k-Means Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

A Two-Stage Constrained Submodular Maximization.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

An Approximation Algorithm for the Dynamic k-level Facility Location Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Approximation and hardness results for the Max <i>k</i>-Uncut problem.
Theor. Comput. Sci., 2018

An approximation algorithm for the <i>k</i>-median problem with uniform penalties via pseudo-solution.
Theor. Comput. Sci., 2018

Approximation algorithms for the robust facility leasing problem.
Optim. Lett., 2018

Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming.
Math. Program., 2018

A sparse enhanced indexation model with chance and cardinality constraints.
J. Glob. Optim., 2018

Approximation algorithms for the robust/soft-capacitated 2-level facility location problems.
J. Glob. Optim., 2018

Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain.
J. Glob. Optim., 2018

A local search approximation algorithm for a squared metric k-facility location problem.
J. Comb. 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

An approximation algorithm for soft capacitated k-facility location problem.
J. Comb. Optim., 2018

A local search approximation algorithm for the uniform capacitated k-facility location problem.
J. Comb. Optim., 2018

Selfishness need not be bad: a general proof.
CoRR, 2018

Editorial: Special Issue on Computing and Combinatorics.
Algorithmica, 2018

Approximation and Competitive Algorithms for Single-Minded Selling Problem.
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

A Local Search Approximation Algorithm for the k-means Problem with Penalties.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Approximation Algorithms for Maximum Coverage with Group Budget Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique.
Theor. Comput. Sci., 2016

Editorial for Computing and Combinatorics Conference.
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 Max-3-Uncut problem using complex semidefinite programming rounding.
J. Comb. Optim., 2016

Approximation and Hardness Results for the Max k-Uncut Problem.
Proceedings of the Combinatorial Optimization and Applications, 2016

An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy 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

Safe Approximations for Distributionally Robust Joint Chance Constrained Program.
Asia Pac. J. Oper. Res., 2015

Guest Editorial.
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 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

A cost-sharing method for the multi-level economic lot-sizing game.
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

A cross-monotonic cost-sharing scheme for the concave facility location game.
J. Glob. Optim., 2013

The complexity of two supply chain scheduling problems.
Inf. Process. Lett., 2013

Approximation Algorithms for Integrated Distribution Network Design Problems.
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
A cost-sharing method for an uncapacitated facility location game with penalties.
J. Syst. Sci. Complex., 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
An approximation algorithm for the k-level stochastic facility location problem.
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
A cost-sharing method for an economic lot-sizing game.
Oper. Res. Lett., 2009

A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
Approximation algorithm for facility location with service installation costs.
Oper. Res. Lett., 2008

2006
The <i>k</i>-level facility location game.
Oper. Res. Lett., 2006

2003
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations.
Optim. Methods Softw., 2003

Improved Approximation Algorithms for MAX \frac<i>n</i>\text2-DIRECTED-BISECTION and MAX \frac<i>n</i>\text2-DENSE-SUBGRAPH.
J. Glob. Optim., 2003


  Loading...