Pages that link to "Item:Q5479368"
From MaRDI portal
The following pages link to Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479368):
Displayed 19 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
- Maximum matching on trees in the online preemptive and the incremental graph models (Q2329370) (← links)
- Weighted matching in the semi-streaming model (Q2428674) (← links)
- Bipartite matching in the semi-streaming model (Q2429353) (← links)
- Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- On Randomized Algorithms for Matching in the Online Preemptive Model (Q3452797) (← links)
- Maximum Matching in Turnstile Streams (Q3452845) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- Evolutionary Network Analysis (Q5178094) (← links)
- (Q5743413) (← links)
- (Q5743414) (← links)