"Lower bounds for two-period grooming via linear programming duality."

Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk (2008)

Details and statistics

DOI: 10.1002/NET.20251

access: closed

type: Journal Article

metadata version: 2017-05-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics