Sufficient Conditions, Cost Bounds, and Approximation Algorithms for the Graph Bisectioning Problem

Saab, Youssef Georges; Rao, Vasant B.

Permalink

https://hdl.handle.net/2142/74478 Copy

Description

Title

Sufficient Conditions, Cost Bounds, and Approximation Algorithms for the Graph Bisectioning Problem

Author(s)

• Saab, Youssef Georges
• Rao, Vasant B.

Issue Date

1990-06

Keyword(s)

• Graph bisectioning
• Lower bound
• Upper bound
• Conditions for optimality
• Heuristics

Publisher

Coordinated Science Laboratory, University of Illinois at Urbana-Champaign

Series/Report Name or Number

Coordinated Science Laboratory Report no. UILU-ENG-90-2219, DAC-20

Type of Resource

text

Language

English

Permalink

http://hdl.handle.net/2142/74478

Sponsor(s)/Grant Number(s)

Semiconductor Research Corporation / SRC 86-12-109

Owning Collections