Pages that link to "Item:Q5479368"

The following pages link to Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479368):

Displaying 40 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)
• An estimator for matching size in low arboricity graphs with two applications (Q2106871) (← links)
• Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← 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)
• 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)
• Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
• Evolutionary Network Analysis (Q5178094) (← links)
• (Q5743413) (← links)
• (Q5743414) (← links)
• (Q5875530) (← links)
• Semi-streaming algorithms for submodular matroid intersection (Q5918428) (← links)
• Semi-streaming algorithms for submodular matroid intersection (Q5925648) (← links)
• (Q6062143) (← links)
• Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model (Q6130326) (← links)
• Distributed maximum matching verification in CONGEST (Q6535036) (← links)
• Distributed approximation for \(f\)-matching (Q6614001) (← links)
• Improved bounds for matching in random-order streams (Q6614611) (← links)
• Semi-streaming algorithms for submodular function maximization under \(b\)-matching, matroid, and matchoid constraints (Q6623599) (← links)