61 results on '"Dachuan Xu"'
Search Results
2. Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants.
3. Analysis of the Distribution Characteristics and Influencing Factors of Advertising Billboards in Wuhan.
4. The Regularized Submodular Maximization via the Lyapunov Method.
5. k-Median/Means with Outliers Revisited: A Simple Fpt Approximation.
6. A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set.
7. Online One-Sided Smooth Function Maximization.
8. Differentially Private Submodular Maximization over Integer Lattice.
9. Approximation Algorithms for the Lower Bounded Correlation Clustering Problem.
10. Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functions.
11. MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane.
12. A Game-Theoretic Analysis of Deep Neural Networks.
13. A Trace-restricted Kronecker-Factored Approximation to Natural Gradient.
14. THOR, Trace-based Hardware-driven Layer-Oriented Natural Gradient Descent Computation.
15. The Prize-Collecting k-Steiner Tree Problem.
16. An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint.
17. An Improved Bregman k-means++ Algorithm via Local Search.
18. Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint.
19. Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs.
20. Approximation Guarantees for Parallelized Maximization of Monotone Non-submodular Function with a Cardinality Constraint.
21. The Spherical k-means++ Algorithm via Local Search.
22. Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation.
23. Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint.
24. Parametric Streaming Two-Stage Submodular Maximization.
25. A Primal-Dual Algorithm for Euclidean k-Means Problem with Penalties.
26. Sequence Submodular Maximization Meets Streaming.
27. Streaming Submodular Maximization Under Noises.
28. The Seeding Algorithm for Functional k-Means Problem.
29. Maximization of Constrained Non-submodular Functions.
30. Universal Facility Location in Generalized Metric Space.
31. Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint.
32. Scheduling Three Identical Parallel Machines with Capacity Constraints.
33. A Discretization Algorithm for k-Means with Capacity Constraints.
34. Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions.
35. Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes.
36. The Seeding Algorithm for Spherical k-Means Clustering with Penalties.
37. An Approximation Algorithm for the Dynamic k-level Facility Location Problem.
38. Interaction-Aware Influence Maximization and Iterated Sandwich Method.
39. Local Search Approximation Algorithms for the Spherical k-Means Problem.
40. A Two-Stage Constrained Submodular Maximization.
41. Approximation and Competitive Algorithms for Single-Minded Selling Problem.
42. A Local Search Approximation Algorithm for a Squared Metric k-Facility Location Problem.
43. A Spectral Partitioning Algorithm for Maximum Directed Cut Problem.
44. Approximation Algorithms for Maximum Coverage with Group Budget Constraints.
45. A Local Search Approximation Algorithm for the k-means Problem with Penalties.
46. Approximation and Hardness Results for the Max k-Uncut Problem.
47. An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions.
48. Approximation Algorithm for the Squared Metric Soft Capacitated Facility Location Problem (Extended Abstract).
49. Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties.
50. A (5.83 + ϵ)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.