In memoriam Paolo M. Camerini

DOI10.1016/0166-218X(93)90041-LMaRDI QIDQ1803668zbMATH OpenFDO

Authors Francesco Maffioli

Publication date 29 June 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Memory

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70)

Cites work

• Complexity of spanning tree problems: Part I
• Heuristically guided algorithm for k-parity matroid problems
• Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
• Linking-Centers and Reliable-Trees of a Network
• Most and least uniform spanning trees
• Multi-constrained matroidal knapsack problems
• On the complexity of finding multi-constrained spanning trees
• Some experience in applying a stochastic method to location problems
• The Min-Max Spanning Tree Problem and some extensions
• The matroidal knapsack: A class of (often) well-solvable problems
• Unlabelled Partition Systems: Optimization and Complexity

This page was built for publication: In memoriam Paolo M. Camerini

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