The following pages link to Paolo M. Camerini (Q797495):
Displayed 29 items.
- (Q754222) (redirect page) (← links)
- Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
- The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- On the complexity of finding multi-constrained spanning trees (Q1171508) (← links)
- Polymatroids: Construction and random algorithms (Q1179434) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- Bounds for 3-matroid intersection problems (Q1218336) (← links)
- The Min-Max Spanning Tree Problem and some extensions (Q1244239) (← links)
- Multi-constrained matroidal knapsack problems (Q1824560) (← links)
- Unlabelled Partition Systems: Optimization and Complexity (Q3344219) (← links)
- (Q3678964) (← links)
- Some experience in applying a stochastic method to location problems (Q3716772) (← links)
- (Q3745296) (← links)
- Intersection of Two Matroids: (Condensed) Border Graphs and Ranking (Q3829563) (← links)
- A note on finding optimum branchings (Q3867580) (← links)
- (Q3869085) (← links)
- Thek best spanning arborescences of a network (Q3875356) (← links)
- Polynomial bounding for NP-hard problems (Q3879041) (← links)
- (Q3919448) (← links)
- (Q3987194) (← links)
- Random pseudo-polynomial algorithms for exact matroid problems (Q3990608) (← links)
- (Q4119001) (← links)
- (Q4133397) (← links)
- (Q4198530) (← links)
- Linking-Centers and Reliable-Trees of a Network (Q4721051) (← links)
- The Bounded Path Tree Problem (Q4750668) (← links)