Ding-Zhu Du

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Xianyue Li

> Home > Persons > Ding-Zhu Du

Publications

2020
[j207]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/LiZYZD20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/LiZYZD20
Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang, Ding-Zhu Du:
Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J. Glob. Optim. 77(2): 319-340 (2020)
2019
[j191]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/ZhangLLHD19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/ZhangLLHD19
Zhao Zhang, Zaixin Lu, Xianyue Li, Xiaohui Huang, Ding-Zhu Du:
Online hole healing for sensor coverage. J. Glob. Optim. 75(4): 1111-1131 (2019)
2018
[j183]
- view
  authority control:
- export record
  dblp key:
  - journals/jgo/LiZD18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/LiZD18
Xianyue Li, Zhao Zhang, Ding-Zhu Du:
Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm. J. Glob. Optim. 70(3): 677-685 (2018)
2010
[j132]
- view
  authority control:
- export record
  dblp key:
  - journals/tmc/KimZLWWD10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tmc/KimZLWWD10
Donghyun Kim, Zhao Zhang, Xianyue Li, Wei Wang, Weili Wu, Ding-Zhu Du:
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs. IEEE Trans. Mob. Comput. 9(8): 1108-1118 (2010)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.