Pages that link to "Item:Q5479368"
From MaRDI portal
The following pages link to Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479368):
Displaying 17 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Online maximum matching with recourse (Q830934) (← 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)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
- Online Maximum Matching with Recourse (Q5005104) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- (Q5090980) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- (Q5875530) (← links)
- (Q6062143) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
