0
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice

      Read this article at

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

          Related collections

          Most cited references28

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

          An analysis of approximations for maximizing submodular set functions—I

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

            Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Submodular functions and convexity

              L Lovász (1983)
                Bookmark

                Author and article information

                Contributors
                Journal
                Journal of Global Optimization
                J Glob Optim
                Springer Science and Business Media LLC
                0925-5001
                1573-2916
                January 2023
                June 13 2022
                January 2023
                : 85
                : 1
                : 15-38
                Article
                10.1007/s10898-022-01193-5
                5939ca9f-7f5e-4abf-bb86-afa41dc07d3f
                © 2023

                https://www.springernature.com/gp/researchers/text-and-data-mining

                https://www.springernature.com/gp/researchers/text-and-data-mining

                History

                Comments

                Comment on this article