1 resultado para Lie Algebras With Polynomial Identities
em DigitalCommons@University of Nebraska - Lincoln
Filtro por publicador
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (2)
- Repository Napier (2)
- Aberdeen University (8)
- Abertay Research Collections - Abertay University’s repository (1)
- Academic Archive On-line (Stockholm University; Sweden) (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (3)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (4)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (7)
- Archive of European Integration (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (17)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (20)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (44)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (5)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (20)
- Boston University Digital Common (4)
- Brock University, Canada (12)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (35)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (21)
- CentAUR: Central Archive University of Reading - UK (34)
- Central European University - Research Support Scheme (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (21)
- Cochin University of Science & Technology (CUSAT), India (2)
- Collection Of Biostatistics Research Archive (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (5)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (74)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (2)
- Digital Commons - Michigan Tech (1)
- Digital Commons - Montana Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (19)
- Digital Peer Publishing (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (2)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (7)
- FUNDAJ - Fundação Joaquim Nabuco (2)
- Glasgow Theses Service (4)
- Greenwich Academic Literature Archive - UK (17)
- Helda - Digital Repository of University of Helsinki (4)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (58)
- Institute of Public Health in Ireland, Ireland (1)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Gulbenkian de Ciência (1)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (9)
- Nottingham eTheses (2)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (66)
- Queensland University of Technology - ePrints Archive (147)
- Repositorio Académico de la Universidad Nacional de Costa Rica (2)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (71)
- Research Open Access Repository of the University of East London. (1)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Scielo España (1)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (12)
- Universidade Complutense de Madrid (3)
- Universidade de Lisboa - Repositório Aberto (3)
- Universidade Federal do Pará (4)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (6)
- Université de Lausanne, Switzerland (2)
- Université de Montréal (2)
- Université de Montréal, Canada (28)
- Université Laval Mémoires et thèses électroniques (3)
- University of Michigan (7)
- University of Queensland eSpace - Australia (15)
- University of Southampton, United Kingdom (1)
- University of Washington (6)
- WestminsterResearch - UK (5)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.