The following pages link to Da-Chuan Xu (Q692667):
Displaying 50 items.
- An improved Bregman \(k\)-means++ algorithm via local search (Q2019501) (← links)
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← 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)
- An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- The approximation algorithm based on seeding method for functional \(k\)-means problem (Q2076447) (← links)
- An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
- The seeding algorithm for spherical \(k\)-means clustering with penalties (Q2082212) (← links)
- The spherical \(k\)-means++ algorithm via local search scheme (Q2084616) (← links)
- Improved local search algorithms for Bregman \(k\)-means and its variants (Q2084627) (← links)
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint (Q2084653) (← links)
- Approximation algorithm for spherical \(k\)-means problem with penalty (Q2086912) (← links)
- A game-theoretic perspective of deep neural networks (Q2098170) (← links)
- Parametric streaming two-stage submodular maximization (Q2110710) (← 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)
- Selfish bin packing under harmonic mean cost sharing mechanism (Q2136882) (← links)
- A game-theoretic analysis of deep neural networks (Q2151381) (← links)
- Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
- Maximizing a monotone non-submodular function under a knapsack constraint (Q2156291) (← links)
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Interaction-aware influence maximization and iterated sandwich method (Q2173299) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
- Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
- A constrained two-stage submodular maximization (Q2220851) (← links)
- Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
- Bicriteria algorithms to balance coverage and cost in team formation under online model (Q2220862) (← links)
- Soft-capacitated facility location game (Q2267278) (← links)
- Local search approximation algorithms for the sum of squares facility location problems (Q2274862) (← links)
- Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem'' (Q2275586) (← links)
- The seeding algorithm for \(k\)-means problem with penalties (Q2292125) (← links)
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem (Q2295313) (← links)
- The seeding algorithm for Functional \(k\)-Means problem (Q2300054) (← links)
- Universal facility location in generalized metric space (Q2300073) (← links)
- Maximization of constrained non-submodular functions (Q2300075) (← links)
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint (Q2300078) (← links)
- The seeding algorithms for spherical \(k\)-means clustering (Q2307745) (← links)
- Non-submodular maximization on massive data streams (Q2307748) (← links)
- An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- A note on submodularity preserved involving the rank functions (Q2326075) (← links)
- Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
