Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
69.131 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Approximating layout problems on geometric random graphs

Thumbnail
View/Open
1400300649.pdf (1005,Kb)
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/371020

Show full item record
Díaz Cort, JosepMés informacióMés informacióMés informació
Penrose, Mathew D.
Petit Silvestre, JordiMés informacióMés informacióMés informació
Serna Iglesias, María JoséMés informacióMés informacióMés informació
Document typeResearch report
Defense date1998-10-13
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 4.0 International
This work is protected by the corresponding intellectual and industrial property rights. Except where otherwise noted, its contents are licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 4.0 International
Abstract
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.
CitationDiaz, J. [et al.]. Approximating layout problems on geometric random graphs. 1998. 
Is part ofLSI-98-56-R
URIhttp://hdl.handle.net/2117/371020
Collections
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals - Reports de recerca [140]
  • Departament de Ciències de la Computació - Reports de recerca [1.109]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
1400300649.pdf1005,KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina