Date of Original Version

1-2000

Type

Conference Proceeding

Abstract or Description

A natural and simple randomized algorithm gives the best-known approximation for Bandwidth Minimization on trees and chordal graphs.

Share

COinS
 

Published In

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 788-793.