\textsc{Greedy+Singleton}: an efficient approximation algorithm for $k$-submodular knapsack maximization (Q6180752): Difference between revisions

Latest revision as of 19:11, 30 December 2024

scientific article; zbMATH DE number 7782075

Language	Label	Description	Also known as
English	\textsc{Greedy+Singleton}: an efficient approximation algorithm for $k$-submodular knapsack maximization	scientific article; zbMATH DE number 7782075

Statements

instance of

scholarly article

0 references

title

\textsc{Greedy+Singleton}: an efficient approximation algorithm for $k$-submodular knapsack maximization (English)

0 references

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

2 January 2024

0 references

zbMATH Keywords

submodularity

0 references

approximation algorithm

0 references

greedy algorithm

0 references

knapsack

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2023.114320

0 references

cites work

Monotone $k$-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm

0 references

The generalized maximum coverage problem

0 references

On $k$-Submodular Relaxation

0 references

Towards Minimizing k-Submodular Functions

0 references

Improved Approximation Algorithms for k-Submodular Function Maximization

0 references

The budgeted maximum coverage problem

0 references

A refined analysis of submodular greedy

0 references

The application of the global quasi-linearisation technique to the analysis of the cyclohexane/air mixture autoignition

0 references

Improved Randomized Algorithm for k-Submodular Function Maximization

0 references

Maximizing $k$-submodular functions under budget constraint: applications and streaming algorithms

0 references

On maximizing a monotone $k$-submodular function subject to a matroid constraint

0 references

Maximization of $k$-submodular function with a matroid constraint

0 references

A note on maximizing a submodular set function subject to a knapsack constraint

0 references

Monotone $k$-submodular secretary problems: cardinality and knapsack constraints

0 references

On maximizing a monotone $k$-submodular function under a knapsack constraint

0 references

Maximizing k -Submodular Functions and Beyond

0 references

Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems

0 references

Guarantees for maximization of $k$-submodular functions with a knapsack and a matroid constraint

0 references

On maximizing monotone or non-monotone $k$-submodular functions with the intersection of knapsack and matroid constraints

0 references

An exact cutting plane method for $k$-submodular function maximization

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1016/J.TCS.2023.114320

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6180752

@@ Property / DOI @@
-.1016/j.tcs.2023.114320
@@ Property / DOI: 10.1016/j.tcs.2023.114320 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2023.114320
+Normal rank
@@ Property / OpenAlex ID @@
+W4389060545
@@ Property / OpenAlex ID: W4389060545 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm
+Normal rank
@@ Property / cites work @@
+The generalized maximum coverage problem
@@ Property / cites work: The generalized maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+On $k$-Submodular Relaxation
@@ Property / cites work: On $k$-Submodular Relaxation / rank @@
+Normal rank
@@ Property / cites work @@
+Towards Minimizing k-Submodular Functions
@@ Property / cites work: Towards Minimizing k-Submodular Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+A refined analysis of submodular greedy
@@ Property / cites work: A refined analysis of submodular greedy / rank @@
+Normal rank
@@ Property / cites work @@
+The application of the global quasi-linearisation technique to the analysis of the cyclohexane/air mixture autoignition
+Normal rank
@@ Property / cites work @@
+Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization
+Normal rank
@@ Property / cites work @@
+Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
+Normal rank
@@ Property / cites work @@
+On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
+Normal rank
@@ Property / cites work @@
+Maximization of \(k\)-submodular function with a matroid constraint
+Normal rank
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints
+Normal rank
@@ Property / cites work @@
+On maximizing a monotone \(k\)-submodular function under a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Maximizing             <i>k</i>             -Submodular Functions and Beyond
+Normal rank
@@ Property / cites work @@
+Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
+Normal rank
@@ Property / cites work @@
+Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint
+Normal rank
@@ Property / cites work @@
+On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
+Normal rank
@@ Property / cites work @@
+An exact cutting plane method for \(k\)-submodular function maximization
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2023.114320
@@ Property / DOI: 10.1016/J.TCS.2023.114320 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6180752

\textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752): Difference between revisions

Latest revision as of 19:11, 30 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)