Maximum matching on trees in the online preemptive and the incremental graph models (Q2329370): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-019-00593-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2951788872
@@ Property / OpenAlex ID: W2951788872 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Fully Dynamic Matchings with Small Approximation Ratios
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time
+Normal rank
@@ Property / cites work @@
+On Randomized Algorithms for Matching in the Online Preemptive Model
+Normal rank
@@ Property / cites work @@
+Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
+Normal rank
@@ Property / cites work @@
+Improved Bounds for Online Preemptive Matching
@@ Property / cites work: Improved Bounds for Online Preemptive Matching / 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 @@
+Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
+Normal rank
@@ Property / cites work @@
+Online Weighted Matching
@@ Property / cites work: Online Weighted Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2329370