Showing 1 - 14 results of 14 for search '"inapproximability"', query time: 0.83s Refine Results
  1. 1
    Digging deeper into clustering and covering problems
    by Bandyapadhyay, Sayan
    Published 2019
    Subjects: “...Inapproximability...”
    Get full text
    Get full text
    Others
  2. 2
    Inapproximability of the Minimum Biclique Edge Partition Problem
    by HIRATA, Tomio, OTSUKI, Hideaki
    Published 2010
    Subjects: “...inapproximability...”
    Get full text
    Get full text
  3. 3
    Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis
    by Koichi Yamazaki
    Published 2018-10-01
    Subjects: “...inapproximability...”
    Get full text
    Article
  4. 4
    The Inapproximability of <i>k</i>-<span style="font-variant: small-caps">DominatingSet</span> for Parameterized <inline-formula> <mml:math id="mm841" display="block"> <mml:semantics> <mml:msup> <mml:mrow> <mml:mi mathvariant="sans-serif">AC</mml:mi> </mml:mrow> <mml:mn mathvariant="sans-serif">0</mml:mn> </mml:msup> </mml:semantics> </mml:math> </inline-formula> Circuits <xref rid="fn1-algorithms-565032" ref-type="fn">†</xref>
    by Wenxing Lai
    Published 2019-11-01
    Subjects: “...inapproximability...”
    Get full text
    Article
  5. 5
    Improved inapproximability of Max-Cut through Min-Cut
    by Wiman, Mårten
    Published 2018
    Subjects: “...Inapproximability...”
    Get full text
    Others
  6. 6
    Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
    by Wenner, Cenny
    Published 2014
    Subjects: “...Inapproximability...”
    Get full text
    Get full text
    Doctoral Thesis
  7. 7
    Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness
    by Huang, Sangxia
    Published 2015
    Subjects: “...inapproximability...”
    Get full text
    Get full text
    Doctoral Thesis
  8. 8
    Recoloração convexa de grafos: algoritmos e poliedros
    by Moura, Phablo Fernando Soares
    Published 2013
    Subjects: “...inapproximability...”
    Get full text
    Others
  9. 9
    Recoloração convexa de grafos: algoritmos e poliedros
    by Phablo Fernando Soares Moura
    Published 2013
    Subjects: “... inapproximability ...”
    Get full text
  10. 10
    Computational and communication complexity of geometric problems
    by Hajiaghaei Shanjani, Sima
    Published 2021
    Subjects: “...Inapproximability...”
    Get full text
    Others
  11. 11
    Graph colorings and digraph subdivisions
    by Moura, Phablo Fernando Soares
    Published 2017
    Subjects: “...Inapproximability...”
    Get full text
    Others
  12. 12
    Graph colorings and digraph subdivisions
    by Phablo Fernando Soares Moura
    Published 2017
    Subjects: “... Inapproximability ...”
    Get full text
  13. 13
    The k-hop connected dominating set problem: approximation algorithms and hardness results
    by Coelho, Rafael Santos
    Published 2017
    Subjects: “...Inapproximability threshold...”
    Get full text
    Others
  14. 14
    The k-hop connected dominating set problem: approximation algorithms and hardness results
    by Rafael Santos Coelho
    Published 2017
    Subjects: “... Inapproximability threshold ...”
    Get full text
Search Tools: Get RSS Feed — Email this Search