Essec\Faculty\Model\Contribution {#2190
  #_index: "academ_contributions"
  #_id: "4918"
  #_source: array:26 [
    "id" => "4918"
    "slug" => "on-the-approximation-of-some-spanning-arborescence-problems"
    "yearMonth" => "1998-01"
    "year" => "1998"
    "title" => "On the Approximation of Some Spanning Arborescence Problems"
    "description" => "ALFANDARI, L. et PASCHOS, V. (1998). On the Approximation of Some Spanning Arborescence Problems. Dans: <i>Advances in Computer and Information Sciences '98. 13th International Symposium on Computer and Information Sciences (ISCIS)</i>. IOS Press, pp. 574-581."
    "authors" => array:2 [
      0 => array:3 [
        "name" => "ALFANDARI Laurent"
        "bid" => "B00000901"
        "slug" => "alfandari-laurent"
      ]
      1 => array:1 [
        "name" => "PASCHOS V."
      ]
    ]
    "ouvrage" => "Advances in Computer and Information Sciences '98. 13th International Symposium on Computer and Information Sciences (ISCIS)"
    "keywords" => []
    "updatedAt" => "2021-04-19 17:57:25"
    "publicationUrl" => null
    "publicationInfo" => array:3 [
      "pages" => "574-581"
      "volume" => null
      "number" => null
    ]
    "type" => array:2 [
      "fr" => "Actes d'une conférence"
      "en" => "Conference Proceedings"
    ]
    "support_type" => array:2 [
      "fr" => "Editeur"
      "en" => "Publisher"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "Nous présentons une classe de problèmes d'optimisation, appelée M-ST (Master-Slave Tractable), consistant à couvrir ou partitionner les sommets ou les arêtes d'un graphe par des sous-graphes. Ces problèmes, en général NP-difficiles, sont tous approximables à rapport logarithmique par une instanciation de l'algorithme glouton classique par le problème de Set Covering. Des applications sont présentées dans le domaine du dimensionnement de réseau (Network Design)."
      "en" => "We define a new class of optimization problems, called M-ST (Master-Slave Tractable), which consist in covering or partitioning the vertex-set (or the edge-set) of a weighted graph by subgraphs. These NP-hard problems can be approximated within logarithmic ratio by an instanciation of the classical greedy algorithm for the Set Covering problem. Several applications are presented in the field of Network Design."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2024-04-16T10:22:02.000Z"
    "docTitle" => "On the Approximation of Some Spanning Arborescence Problems"
    "docSurtitle" => "Conference Proceedings"
    "authorNames" => "<a href="/cv/alfandari-laurent">ALFANDARI Laurent</a>, PASCHOS V."
    "docDescription" => "<span class="document-property-authors">ALFANDARI Laurent, PASCHOS V.</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">1998</span>"
    "keywordList" => ""
    "docPreview" => "<b>On the Approximation of Some Spanning Arborescence Problems</b><br><span>1998-01 | Conference Proceedings </span>"
    "docType" => "research"
    "publicationLink" => "<a href="#" target="_blank">On the Approximation of Some Spanning Arborescence Problems</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.993841
  +"parent": null
}