The following pages link to Du Ding-Zhu (Q166203):
Displaying 13 items.
- Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs. (Q5958088) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)
- Placement of data replicas for optimal data availability in ring networks (Q5959181) (← links)
- A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem (Q6049083) (← links)
- Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning (Q6077937) (← links)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
- Distance magic labeling of the halved folded \(n\)-cube (Q6167023) (← links)
- Special issue: Machine learning and optimization II (Q6542982) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio (Q6580540) (← links)
- Budget-constrained profit maximization without non-negative objective assumption in social networks (Q6635815) (← links)
- Approximation algorithm for prize-collecting vertex cover with fairness constraints (Q6646739) (← links)
