Marcus Volz

According to our database, Marcus Volz authored at least 7 papers between 2013 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Simplifying obstacles for Steiner network problems in the plane.

Marcus Volz, Marcus Brazil, Charl J. Ras, Doreen A. Thomas

Networks, 2022

An exact algorithm for constructing minimum Euclidean skeletons of polygons.

Nicolau Andrés-Thió, Marcus Brazil, Charl J. Ras, Doreen A. Thomas, Marcus Volz

J. Glob. Optim., 2022

2020

Computing Skeletons for Rectilinearly Convex Obstacles in the Rectilinear Plane.

Marcus Volz, Marcus Brazil, Charl J. Ras, Doreen A. Thomas

J. Optim. Theory Appl., 2020

Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem.

Michael S. Payne, Charl J. Ras, Marcus Volz

CoRR, 2020

2019

Computing minimum 2-edge-connected Steiner networks in the Euclidean plane.

Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas

Networks, 2019

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem.

Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas

Comput. Geom., 2019

2013

The Gilbert arborescence problem.

M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas

Networks, 2013