Person:797495

Available identifiers

zbMath Open camerini.paolo-mMaRDI QIDQ797495

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3987194	1992-06-28	Paper
Random pseudo-polynomial algorithms for exact matroid problems	1992-06-28	Paper
The image of weighted combinatorial problems	1992-06-27	Paper
Polymatroids: Construction and random algorithms	1992-06-26	Paper
Multi-constrained matroidal knapsack problems	1989-01-01	Paper
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking	1989-01-01	Paper
Most and least uniform spanning trees	1986-01-01	Paper
Some experience in applying a stochastic method to location problems	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3745296	1986-01-01	Paper
Linking-Centers and Reliable-Trees of a Network	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3678964	1985-01-01	Paper
The matroidal knapsack: A class of (often) well-solvable problems	1984-01-01	Paper
Unlabelled Partition Systems: Optimization and Complexity	1984-01-01	Paper
On the complexity of finding multi-constrained spanning trees	1983-01-01	Paper
The Bounded Path Tree Problem	1982-01-01	Paper
Ranking arborescences in O(Km log n) time	1980-01-01	Paper
Complexity of spanning tree problems: Part I	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3869085	1980-01-01	Paper
Thek best spanning arborescences of a network	1980-01-01	Paper
Polynomial bounding for NP-hard problems	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3919448	1980-01-01	Paper
A note on finding optimum branchings	1979-01-01	Paper
Heuristically guided algorithm for k-parity matroid problems	1978-01-01	Paper
The Min-Max Spanning Tree Problem and some extensions	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4198530	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4119001	1976-01-01	Paper
Bounds for 3-matroid intersection problems	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4133397	1975-01-01	Paper

Research outcomes over time

This page was built for person: Paolo M. Camerini