Q4969210 (Q4969210): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalized likelihood regression for generalized linear models with non-quadratic penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Submodular Functions: A Convex Optimization Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Submodular Maximization with Preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Continuous Greedy Algorithm for Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online submodular welfare maximization: Greedy is optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinantal Point Processes for Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:10, 23 July 2024

scientific article; zbMATH DE number 7255156
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7255156

    Statements

    0 references
    0 references
    0 references
    5 October 2020
    0 references
    0 references
    continuous submodularity
    0 references
    non-monotone submodular maximization
    0 references
    approximation algorithms
    0 references