Michael B. Richey

According to our database, Michael B. Richey authored at least 5 papers between 1985 and 1992.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1992

Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization.

Michael B. Richey, Abraham P. Punnen

Discret. Appl. Math., 1992

1991

Improved bounds for harmonic-based bin packing algorithms.

Michael B. Richey

Discret. Appl. Math., 1991

1990

Optimal location of a path or tree on a network with cycles.

Michael B. Richey

Networks, 1990

1986

On multiple steiner subgraph problems.

Michael B. Richey, R. Gary Parker

Networks, 1986

1985

An efficiently solvable case of the minimum weight equivalent subgraph problem.

Michael B. Richey, R. Gary Parker, Ronald L. Rardin

Networks, 1985