Pages that link to "Item:Q2428674"
From MaRDI portal
The following pages link to Weighted matching in the semi-streaming model (Q2428674):
Displaying 16 items.
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
- On graph problems in a semi-streaming model (Q2581265) (← links)
- (Q2957901) (← links)
- Improved streaming algorithms for weighted matching, via unweighted matching (Q2969611) (← links)
- IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * (Q3113762) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- Maximum Matching in Turnstile Streams (Q3452845) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- Automata, Languages and Programming (Q5466491) (← links)
- (Q5743413) (← links)
- Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
- Semi-streaming algorithms for submodular function maximization under \(b\)-matching, matroid, and matchoid constraints (Q6623599) (← links)