• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Discover

AuthorMonnot, Jérôme (7)Toulouse, Sophie (4)Paschos, Vangelis (3)Hassin, Refael (2)Lucarelli, Giorgio (2)Milis, Ioannis (2)Segev, Danny (2)Bourgeois, Nicolas (1)Couëtoux, Basile (1)Dondi, Riccardo (1)... Plus d'optionsSubject
approximation algorithms (12)
bipartite graphs (3)minimum k-path partition (3)NP-completeness (3)Pk-partition (3)APX-hardness (2)hardness of approximation (2)maximum (weighted) Pk-packing (2)3-length chain (1)algorithms (1)... Plus d'optionsDate Issued2010 - 2018 (3)2000 - 2009 (8)1991 - 1999 (1)Type de document
Communication / Conférence (12)

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-10 of 12

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

Approximation results for the weighted P4 partition problems 

Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
Thumbnail

The Lazy Matroid Problem 

Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2014) Communication / Conférence
Thumbnail

On Labeled Traveling Salesman Problems 

Couëtoux, Basile; Gourvès, Laurent; Monnot, Jérôme; Telelis, Orestis (2008) Communication / Conférence
Thumbnail

The complexity of the Pk partition problem and related problems in bipartite graphs 

Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
Thumbnail

Pk partition problem and related problems in bipartite graphs 

Monnot, Jérôme; Toulouse, Sophie (2007) Communication / Conférence
Thumbnail

A theorem on the approximation of set cover and vertex cover 

Paschos, Vangelis (1991) Communication / Conférence
Thumbnail

On the Maximum Edge Coloring Problem (Extended Abstract) 

Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis (2009) Communication / Conférence
Thumbnail

The complexity of the Pk partition problem and related problems in bipartite graphs 

Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
Thumbnail

Approximation Algorithms and Hardness Results for Labeled Connectivity Problems 

Hassin, Refael; Monnot, Jérôme; Segev, Danny (2006) Communication / Conférence
Thumbnail

The Complexity of bottleneck labeled graph problems 

Hassin, Refael; Monnot, Jérôme; Segev, Danny (2007) Communication / Conférence
  • «
  • 1
  • 2
  • »

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.