Paolo M. Camerini

According to our database, Paolo M. Camerini authored at least 12 papers between 1975 and 1992.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1992

Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.

Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli

J. Algorithms, 1992

1991

The image of weighted combinatorial problems.

Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli

Ann. Oper. Res., 1991

1990

Modular Arithmetic and Randomization for Exact Matroid Problems.

Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

Intersection of Two Matroids: (Condensed) Border Graphs and Ranking.

Paolo M. Camerini, Horst W. Hamacher

SIAM J. Discret. Math., 1989

Multi-constrained matroidal knapsack problems.

Paolo M. Camerini, Francesco Maffioli, Carlo Vercellis

Math. Program., 1989

1986

Most and least uniform spanning trees.

Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth

Discret. Appl. Math., 1986

1983

On the complexity of finding multi-constrained spanning trees.

Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli

Discret. Appl. Math., 1983

1980

The <i>k</i> best spanning arborescences of a network.

Paolo M. Camerini, Luigi Fratta, Francesco Maffioli

Networks, 1980

1979

A note on finding optimum branchings.

Paolo M. Camerini, Luigi Fratta, Francesco Maffioli

Networks, 1979

1978

The Min-Max Spanning Tree Problem and Some Extensions.

Paolo M. Camerini

Inf. Process. Lett., 1978

Heuristically guided algorithm for k-parity matroid problems.

Paolo M. Camerini, Francesco Maffioli

Discret. Math., 1978

1975

Bounds for 3-Matroid Intersection Problems.

Paolo M. Camerini, Francesco Maffioli

Inf. Process. Lett., 1975