View in EDS HTML Full Text PDF Full Text

Complexity and inapproximability results for the Power Edge Set problem.

Saved in:
Bibliographic Details
Title: Complexity and inapproximability results for the Power Edge Set problem.
Authors: Toubaline, Sonia1,2 sonia.toubaline@dauphine.fr, D’Ambrosio, Claudia2 dambrosio@lix.polytechnique.fr, Liberti, Leo2 liberti@lix.polytechnique.fr, Poirion, Pierre-Louis2 poirion@lix.polytechnique.fr, Schieber, Baruch3 sbar@us.ibm.com, Shachnai, Hadas4 hadas@cs.technion.ac.il
Source: Journal of Combinatorial Optimization. Apr2018, Vol. 35 Issue 3, p895-905. 11p.
Database: Mathematics Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: msf
DbLabel: Mathematics Source
An: 128548991
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Complexity and inapproximability results for the Power Edge Set problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Toubaline%2C+Sonia%22">Toubaline, Sonia</searchLink><relatesTo>1,2</relatesTo><i> sonia.toubaline@dauphine.fr</i><br /><searchLink fieldCode="AR" term="%22D’Ambrosio%2C+Claudia%22">D’Ambrosio, Claudia</searchLink><relatesTo>2</relatesTo><i> dambrosio@lix.polytechnique.fr</i><br /><searchLink fieldCode="AR" term="%22Liberti%2C+Leo%22">Liberti, Leo</searchLink><relatesTo>2</relatesTo><i> liberti@lix.polytechnique.fr</i><br /><searchLink fieldCode="AR" term="%22Poirion%2C+Pierre-Louis%22">Poirion, Pierre-Louis</searchLink><relatesTo>2</relatesTo><i> poirion@lix.polytechnique.fr</i><br /><searchLink fieldCode="AR" term="%22Schieber%2C+Baruch%22">Schieber, Baruch</searchLink><relatesTo>3</relatesTo><i> sbar@us.ibm.com</i><br /><searchLink fieldCode="AR" term="%22Shachnai%2C+Hadas%22">Shachnai, Hadas</searchLink><relatesTo>4</relatesTo><i> hadas@cs.technion.ac.il</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Combinatorial+Optimization%22">Journal of Combinatorial Optimization</searchLink>. Apr2018, Vol. 35 Issue 3, p895-905. 11p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=128548991
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10878-017-0241-y
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 895
    Titles:
      – TitleFull: Complexity and inapproximability results for the Power Edge Set problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Toubaline, Sonia
      – PersonEntity:
          Name:
            NameFull: D’Ambrosio, Claudia
      – PersonEntity:
          Name:
            NameFull: Liberti, Leo
      – PersonEntity:
          Name:
            NameFull: Poirion, Pierre-Louis
      – PersonEntity:
          Name:
            NameFull: Schieber, Baruch
      – PersonEntity:
          Name:
            NameFull: Shachnai, Hadas
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 13826905
          Numbering:
            – Type: volume
              Value: 35
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Combinatorial Optimization
              Type: main
ResultId 1