Popularity at minimum cost

DOI10.1007/978-3-642-17517-6_15MaRDI QIDQ6827971zbMATH OpenFDO

Authors Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar

Publication date 9 December 2010

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Popularity at minimum cost

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