On generalizations of network design problems with degree bounds

DOI10.1007/978-3-642-13036-6_9MaRDI QIDQ6826442zbMATH OpenFDO

Authors N. Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis

Publication date 22 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13036-6_9

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: On generalizations of network design problems with degree bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826442)