29 results on '"Dachuan Xu"'
Search Results
2. Online learning under one sided σ-smooth function.
3. Maximizing a monotone non-submodular function under a knapsack constraint.
4. Improved local search algorithms for Bregman k-means and its variants.
5. An approximation algorithm for the uniform capacitated k-means problem.
6. The seeding algorithm for spherical k-means clustering with penalties.
7. The spherical k-means++ algorithm via local search scheme.
8. Approximation algorithms for two variants of correlation clustering problem.
9. Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint.
10. Bicriteria streaming algorithms to balance gain and cost with cardinality constraint.
11. Sequence submodular maximization meets streaming.
12. A spectral partitioning algorithm for maximum directed cut problem.
13. Approximation algorithms for the lower bounded correlation clustering problem.
14. Two approximation algorithms for maximizing nonnegative weakly monotonic set functions.
15. Approximating the τ-relaxed soft capacitated facility location problem.
16. The seeding algorithm for k-means problem with penalties.
17. Preface.
18. Local search approximation algorithms for the k-means problem with penalties.
19. Approximation algorithm for squared metric two-stage stochastic facility location problem.
20. A local search approximation algorithm for the uniform capacitated k-facility location problem.
21. An approximation algorithm for soft capacitated k-facility location problem.
22. Approximation algorithms for precedence-constrained identical machine scheduling with rejection.
23. An approximation algorithm for k-facility location problem with linear penalties using local search scheme.
24. A local search approximation algorithm for a squared metric k-facility location problem.
25. An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding.
26. An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems.
27. A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties.
28. Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems.
29. An approximation algorithm for the k-level capacitated facility location problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.