Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Academic Journal

About some robustness and complexity properties of G-graphs networks

  • Authors :

Subjects: Graphs and groups

  • Source: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal.univ-antilles.fr/hal-02350149 ; Discrete Applied Mathematics, 2015, 182,

Record details

×
Academic Journal

Bridging gap between standard and differential polynomial approxiamtion: the case of bin-packing

  • Authors :

Subjects: Approximate algorithms

  • Source: ISSN: 0893-9659 ; Applied Mathematics Letters ; https://hal.science/hal-00004007 ; Applied Mathematics Letters, 1999, 12,

Record details

×
Academic Journal

A hypocoloring model for batch scheduling

  • Authors :

Subjects: Batch scheduling

  • Source: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal.science/hal-00004032 ; Discrete Applied Mathematics, 2005, 146 (1),

Record details

×
Academic Journal

Differential approximation results for the Steiner tree problem

  • Authors :

Subjects: Approximate algorithms

  • Source: ISSN: 0893-9659 ; Applied Mathematics Letters ; https://hal.science/hal-00004058 ; Applied Mathematics Letters, 2003, 16,

Record details

×
Conference

Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation

  • Authors :

Subjects: Graph coloring

  • Source: ISAAC. 04 ; xxx ; https://hal.science/hal-00004074 ; xxx, 2004, France. pp.896-907

Record details

×
Academic Journal

Maximizing the number of unused bins

  • Authors :

Subjects: Approximate algorithms

  • Source: Foundations of Computing and Decision Sciences ; https://hal.science/hal-00004010 ; Foundations of Computing and Decision Sciences, 2001, 26, pp.169-186

Record details

×
  • 1-10 of  11 results for ""Mathematics""