Submodular maximization meets streaming: matchings, matroids, and more (Q896286): Difference between revisions

Latest revision as of 09:49, 31 December 2024

scientific article; zbMATH DE number 6299366

Submodular Maximization Meets Streaming: Matchings, Matroids, and More

Language	Label	Description	Also known as
English	Submodular maximization meets streaming: matchings, matroids, and more	scientific article; zbMATH DE number 6299366	Submodular Maximization Meets Streaming: Matchings, Matroids, and More

Statements

instance of

scholarly article

0 references

title

Submodular maximization meets streaming: matchings, matroids, and more (English)

0 references

Submodular Maximization Meets Streaming: Matchings, Matroids, and More (English)

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

Integer Programming and Combinatorial Optimization

0 references

publication date

9 December 2015

0 references

2 June 2014

0 references

full work available at URL

https://arxiv.org/abs/1309.2038

0 references

zbMATH Keywords

maximum matching

0 references

submodular function

0 references

multiple matroid

0 references

MaRDI profile type

Publication

0 references

cites work

On graph problems in a semi-streaming model

0 references

Weighted Matching in the Semi-Streaming Model

0 references

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model

0 references

Q5743414

0 references

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

0 references

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

0 references

Efficient algorithms for finding maximum matching in graphs

0 references

Buyback Problem - Approximate Matroid Intersection with Cancellation Costs

0 references

Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem

0 references

An analysis of approximations for maximizing submodular set functions—I

0 references

Proceedings of the forty-first annual ACM symposium on Theory of computing

0 references

Fast algorithms for maximizing submodular functions

0 references

Best Algorithms for Approximating the Maximum of a Submodular Set Function

0 references

Identifiers

zbMATH Open document ID

1342.90212

0 references

1418.90217

0 references

DOI

10.1007/978-3-319-07557-0_18

0 references

10.1007/S10107-015-0900-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:896286

@@ Property / DOI @@
-.1007/s10107-015-0900-7
@@ Property / DOI: 10.1007/s10107-015-0900-7 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10107-015-0900-7
@@ Property / DOI: 10.1007/S10107-015-0900-7 / rank @@
+Normal rank
@@ Property / cites work @@
+On graph problems in a semi-streaming model
@@ Property / cites work: On graph problems in a semi-streaming model / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted Matching in the Semi-Streaming Model
@@ Property / cites work: Weighted Matching in the Semi-Streaming Model / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
+Normal rank
@@ Property / cites work @@
+Q5743414
@@ Property / cites work: Q5743414 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
+Normal rank
@@ Property / cites work @@
+Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding maximum matching in graphs
+Normal rank
@@ Property / cites work @@
+Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
+Normal rank
@@ Property / cites work @@
+Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Proceedings of the forty-first annual ACM symposium on Theory of computing
+Normal rank
@@ Property / cites work @@
+Fast algorithms for maximizing submodular functions
+Normal rank
@@ Property / cites work @@
+Best Algorithms for Approximating the Maximum of a Submodular Set Function
+Normal rank