In memoriam Paolo M. Camerini
From MaRDI portal
Publication:1803668
DOI10.1016/0166-218X(93)90041-LzbMath0782.01040MaRDI QIDQ1803668
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70)
Cites Work
- Heuristically guided algorithm for k-parity matroid problems
- The matroidal knapsack: A class of (often) well-solvable problems
- Most and least uniform spanning trees
- Complexity of spanning tree problems: Part I
- On the complexity of finding multi-constrained spanning trees
- The Min-Max Spanning Tree Problem and some extensions
- Multi-constrained matroidal knapsack problems
- Unlabelled Partition Systems: Optimization and Complexity
- Some experience in applying a stochastic method to location problems
- Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
- Linking-Centers and Reliable-Trees of a Network