• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Basic concepts in algorithms and complexity theory

Paschos, Vangelis (2010), Basic concepts in algorithms and complexity theory, in Vangelis, Paschos, T., Combinatorial Optimization Volume 1, Concepts of Combinatorial Optimization, ISTE-Wiley : London, Hoboken, p. 3-19

Type
Chapitre d'ouvrage
Date
2010
Book title
Combinatorial Optimization Volume 1, Concepts of Combinatorial Optimization
Book author
Vangelis, Paschos, T.
Publisher
ISTE-Wiley
Published in
London, Hoboken
ISBN
978-1-8482-1146-9
Number of pages
346
Pages
3-19
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Subjects / Keywords
complexity theory; algorithms theory

Related items

Showing items related by title and author.

  • Thumbnail
    A new single model and derived algorithms for the satellite shots planning problem using graph theory concepts 
    Gabrel, Virginie; Moulet, Alain; Murat, Cécile; Paschos, Vangelis (1997) Article accepté pour publication ou publié
  • Thumbnail
    Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model 
    Bourgeois, N.; Catellier, Rémi; Denat, T.; Paschos, Vangelis (2015) Document de travail / Working paper
  • Thumbnail
    Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: some complexity results 
    Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid (1996) Article accepté pour publication ou publié
  • Thumbnail
    On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs (Extended abstract) 
    Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid (1991) Communication / Conférence
  • Thumbnail
    Worst-case complexity of exact algorithms for NP-hard problems 
    Della Croce, Federico; Escoffier, Bruno; Kaminski, Marcin; Paschos, Vangelis (2008) Chapitre d'ouvrage
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo