The following pages link to Du Ding-Zhu (Q166203):
Displaying 50 items.
- Greedy approximations for minimum submodular cover with submodular cost (Q2379694) (← links)
- Optimal relay location for resource-limited energy-efficient wireless communication (Q2433926) (← links)
- Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Polyhedral combinatorics of multi-index axial transportation problems (Q2482774) (← links)
- Progress on maximum weight triangulation (Q2489534) (← links)
- A result about the density of iterated line intersections in the plane (Q2489536) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- Truly selective polygonal mesh hierarchies with error control (Q2573867) (← links)
- Partitionable starters for twin prime power type (Q2641308) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Minimum wireless charger placement with individual energy requirement (Q2692250) (← links)
- Distance magic labeling of the halved folded \(n\)-cube (Q2698004) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- Approximating schedules (Q2711195) (← links)
- Branching solutions to one-dimensional variational problems (Q2718903) (← links)
- Approximating the Steiner minimum tree (Q2743985) (← links)
- The Steiner ratio of \(L_p^3\) (Q2751324) (← links)
- On the rearrangeability of shuffle-exchange networks (Q2751859) (← links)
- Optimal placement of wavelength converters in WDM networks for parallel and distributed computing systems (Q2751928) (← links)
- When is individual testing optimal for nonadaptive group testing? (Q2753543) (← links)
- Steiner ratio for Riemannian manifolds (Q2759261) (← links)
- On maximal premature partial Latin squares (Q2760457) (← links)
- Optimal placement of web proxies for replicated web servers in the internet (Q2762718) (← links)
- Fast distributed graph coloring with \(O(\Delta)\) colors (Q2768357) (← links)
- Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets (Q2784454) (← links)
- Sensor Cover and Double Partition (Q2820119) (← links)
- A Zig-Zag Approach for Competitive Group Testing (Q2940059) (← links)
- Influence Diffusion in Social Networks (Q2949936) (← links)
- A convergence theorem of Rosen’s gradient projection method (Q3030593) (← links)
- (Q3039052) (← links)
- Optimal Assembly of an <i>s</i>-Stage <i>k</i>-Out-of-<i>n</i> System (Q3204299) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
- (Q3318547) (← links)
- (Q3325491) (← links)
- (Q3348420) (← links)
- (Q3348697) (← links)
- (Q3351160) (← links)
- (Q3353038) (← links)
- Reliabilities of Consecutive-2 Graphs (Q3415847) (← links)
- A combinatorial problem related to distributed loop networks (Q3474494) (← links)
- The Steiner ratio conjecture of Gilbert and Pollak is true. (Q3487360) (← links)
- Double Partition: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511407) (← links)
- (Q3514991) (← links)
- (Q3579442) (← links)
- (Q3661322) (← links)
- (Q3663561) (← links)
- A New Bound for the Steiner Ratio (Q3673572) (← links)
- (Q3680625) (← links)
