Partitioning a Graph into Low-Diameter Clusters
- Jack Zhang,
Jack Zhang
[email protected]Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
- Lucas Silveira,
Lucas Silveira
[email protected]Computer Engineering Department, Military Institute of Engineering, Rio de Janeiro, RJ 22290-270, Brazil
- Hamidreza Validi ,
Corresponding Author
Hamidreza Validi
[email protected]https://orcid.org/0000-0002-7983-7262
Department of Industrial, Manufacturing & Systems Engineering, Texas Tech University, Lubbock, Texas 79409
- Logan Smith,
Logan Smith
[email protected]Computational Applied Mathematics & Operations Research, Rice University, Houston, Texas 77005
- Austin Buchanan ,
Austin Buchanan
[email protected]https://orcid.org/0000-0003-2999-9666
Industrial Engineering & Management, Oklahoma State University, Stillwater, Oklahoma 74078
- Illya V. Hicks
Illya V. Hicks
[email protected]https://orcid.org/0000-0002-7815-796X
Computational Applied Mathematics & Operations Research, Rice University, Houston, Texas 77005
Jack Zhang
[email protected]Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Lucas Silveira
[email protected]Computer Engineering Department, Military Institute of Engineering, Rio de Janeiro, RJ 22290-270, Brazil
Corresponding Author
Hamidreza Validi
[email protected]https://orcid.org/0000-0002-7983-7262
Department of Industrial, Manufacturing & Systems Engineering, Texas Tech University, Lubbock, Texas 79409
Logan Smith
[email protected]Computational Applied Mathematics & Operations Research, Rice University, Houston, Texas 77005
Austin Buchanan
[email protected]https://orcid.org/0000-0003-2999-9666
Industrial Engineering & Management, Oklahoma State University, Stillwater, Oklahoma 74078
Illya V. Hicks
[email protected]https://orcid.org/0000-0002-7815-796X
Computational Applied Mathematics & Operations Research, Rice University, Houston, Texas 77005

