1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings 

      Improved Approximation Algorithms for Label Cover Problems

      other

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references14

          • Record: found
          • Abstract: not found
          • Article: not found

          The Dense k -Subgraph Problem

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique

                Bookmark

                Author and book information

                Book Chapter
                2009
                : 23-34
                10.1007/978-3-642-04128-0_3
                84fb4261-8408-4efd-bedb-c9e8bf7a3e05
                History

                Comments

                Comment on this book

                Book chapters

                Similar content1,857

                Cited by2