( en | de | ru )

 

Disambiguation of "Gao, Suogang"

Author of the publication

copydeleteadd this publication to your clipboard
On Approximation Algorithm for the Edge Metric Dimension Problem.

, , , , , and . AAIM, volume 11640 of Lecture Notes in Computer Science, page 142-148. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zhigang Gao

Gao Guo

Yi Gao

Yawen Gao

Hailong Gao

 

Other publications of authors with the same name

Eigenpolynomials associated with subspaces in d-bounded distance-regular graphs., and . Ars Comb., (2011)Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP., , , and . AAIM, volume 13513 of Lecture Notes in Computer Science, page 28-32. Springer, (2022)A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs., and . Ars Comb., (2011)Approximation algorithms for the submodular edge cover problem with submodular penalties., , , , and . Theor. Comput. Sci., (2021)Distance Magic Labeling of the Halved Folded n-Cube., , , , and . AAIM, volume 13513 of Lecture Notes in Computer Science, page 327-338. Springer, (2022)The Terwilliger algebra of the halved n-cube from the viewpoint of its automorphism group action., , , and . Eur. J. Comb., (2022)Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field., , , , and . J. Comput. Biol., 17 (10): 1413-1423 (2010)Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties., , , , , and . J. Comb. Optim., 44 (1): 343-353 (2022)On approximation algorithm for the edge metric dimension problem., , , , , and . Theor. Comput. Sci., (2021)An approximation algorithm for the submodular multicut problem in trees with linear penalties., , , , , and . Optim. Lett., 15 (4): 1105-1112 (2021)