The following pages link to Ding-Zhu Du (Q166203):
Displaying 50 items.
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- Radar placement along banks of river (Q427395) (← links)
- Connected dominating set. Theory and applications (Q436191) (← links)
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← links)
- A novel approach for detecting multiple rumor sources in networks with partial observations (Q512871) (← links)
- Online makespan minimization in MapReduce-like systems with complex reduce tasks (Q526409) (← links)
- On positive-influence target-domination (Q526426) (← links)
- On minimum submodular cover with submodular cost (Q540698) (← links)
- (Q578855) (redirect page) (← links)
- A family of gradient projection methods (Q578856) (← links)
- Remarks on the convergence of Rosen's gradient projection method (Q578857) (← links)
- Steiner minimal trees for bar waves (Q580349) (← links)
- On heuristics for minimum length rectilinear partitions (Q582084) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- Conforming Delaunay triangulations in 3D (Q598238) (← links)
- New dominating sets in social networks (Q604953) (← links)
- Design and analysis of approximation algorithms (Q648055) (← links)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- (Q689123) (redirect page) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs (Q698558) (← links)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
- Influence maximization problem: properties and algorithms (Q830929) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- The approximation algorithm for solving a sort of non-smooth programming (Q884618) (← links)
- Diameter and radius in the Manhattan metric (Q910716) (← links)
- The complexity of determinacy problem on group testing (Q913514) (← links)
- On Rosen's gradient projection methods (Q917449) (← links)
- On the performance of the ICP algorithm (Q934025) (← links)
- Analysis of some bivariate non-linear interpolatory subdivision schemes (Q937170) (← links)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- A superlinearly convergent method to linearly constrained optimization problems under degeneracy (Q1058463) (← links)
- An optimization problem on graphs (Q1085182) (← links)
- Steiner minimal trees on sets of four points (Q1091392) (← links)
- On one-way functions and polynomial-time isomorphisms (Q1097694) (← links)
- (Q1112055) (redirect page) (← links)
- A decomposition theorem on Euclidean Steiner minimal trees (Q1112056) (← links)
- The structure of generalized complexity cores (Q1115611) (← links)
- Notes on polynomial levelability (Q1119389) (← links)
- On the complexity of an optimal routing tree problem (Q1123140) (← links)
- Linear programming with spheres and hemispheres of objective vectors (Q1176803) (← links)
- On Steiner ratio conjectures (Q1179751) (← links)
- Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares (Q1182863) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio (Q1186792) (← links)
