Approximating layout problems on geometric random graphs

We show two simple algorithms that, with high probability, approximate within a constant several layout problems for geometric random graphs drawn from the Gn(r) model r_cv(log¿¿n/n¿ ) for any constant c = 6. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cu...

Full description

Bibliographic Details
Authors: Díaz Cort, Josep|||0000-0003-4422-0067, Penrose, Mathew D., Petit Silvestre, Jordi|||0000-0001-8331-8126, Serna Iglesias, María José|||0000-0001-9729-8648
Format: report
Publication Date:1998
Country:España
Institution:Universitat Politècnica de Catalunya (UPC)
Repository:UPCommons. Portal del coneixement obert de la UPC
Language:English
OAI Identifier:oai:upcommons.upc.edu:2117/371020
Online Access:https://hdl.handle.net/2117/371020
Access Level:Open access
Keyword:Graph algorithms
Algorismes de grafs
Àrees temàtiques de la UPC::Informàtica
Description
Summary:We show two simple algorithms that, with high probability, approximate within a constant several layout problems for geometric random graphs drawn from the Gn(r) model r_cv(log¿¿n/n¿ ) for any constant c = 6. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cut, Minimum Sum Cut, Vertex Separation and Bisection.

Similar Items