In memoriam Paolo M. Camerini

DOI10.1016/0166-218X(93)90041-LzbMATH Open0782.01040MaRDI QIDQ1803668FDOQ1803668

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

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

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)