Pages that link to "Item:Q5362974"

The following pages link to Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Q5362974):

Displaying 50 items.

• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (Q4595963) (← links)
• Decomposing a graph into expanding subgraphs (Q4601444) (← links)
• The Simplex Algorithm Is NP-Mighty (Q4629975) (← links)
• A note on the ring loading problem (Q5362975) (← links)
• Zigzag Persistence via Reflections and Transpositions (Q5362976) (← links)
• Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ³ (Q5362977) (← links)
• Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing (Q5362978) (← links)
• On largest volume simplices and sub-determinants (Q5362979) (← links)
• Approximate Nearest Line Search in High Dimensions (Q5362980) (← links)
• Plurality Consensus in the Gossip Model (Q5362981) (← links)
• Distributed Computation of Large-scale Graph Problems (Q5362982) (← links)
• Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading (Q5362983) (← links)
• Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract) (Q5362984) (← links)
• Internal Pattern Matching Queries in a Text and Applications (Q5362985) (← links)
• Cell-probe bounds for online edit distance and other pattern matching problems (Q5362986) (← links)
• Wavelet Trees Meet Suffix Trees (Q5362987) (← links)
• On Uniform Capacitated <i>k</i>-Median Beyond the Natural LP Relaxation (Q5362988) (← links)
• Dynamic Facility Location via Exponential Clocks (Q5362989) (← links)
• Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems (Q5362990) (← links)
• The amortized cost of finding the minimum (Q5362991) (← links)
• Approximate Range Emptiness in Constant Time and Optimal Space (Q5362992) (← links)
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q5362993) (← links)
• The matching polytope does not admit fully-polynomial size relaxation schemes (Q5362994) (← links)
• Towards a Characterization of Constant-Factor Approximable Min CSPs (Q5362995) (← links)
• Online Principal Components Analysis (Q5362996) (← links)
• Tighter Low-rank Approximation via Sampling the Leveraged Element (Q5362997) (← links)
• The Polyhedron-Hitting Problem (Q5362998) (← links)
• New Approximations for Broadcast Scheduling via Variants of α-point Rounding (Q5362999) (← links)
• A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract] (Q5363000) (← links)
• On (1,<i>∊</i>)-Restricted Assignment Makespan Minimization (Q5363001) (← links)
• A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State (Q5363002) (← links)
• Rejecting jobs to Minimize Load and Maximum Flow-time (Q5363003) (← links)
• Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online <i>K</i>-Item Auction and Bipartite <i>K</i>-Matching with Random Arrival Order (Q5363004) (← links)
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation (Q5363005) (← links)
• Online Network Design Algorithms via Hierarchical Decompositions (Q5363006) (← links)
• Online Stochastic Matching with Unequal Probabilities (Q5363007) (← links)
• Fast Algorithms for Online Stochastic Convex Programming (Q5363008) (← links)
• The optimal absolute ratio for online bin packing (Q5363009) (← links)
• Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel (Q5363010) (← links)
• Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation (Q5363011) (← links)
• A Unified Framework for Clustering Constrained Data without Locality Property (Q5363012) (← links)
• A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem (Q5363013) (← links)
• FPTAS for Counting Monotone CNF (Q5363014) (← links)
• Compatible Connectivity-Augmentation of Planar Disconnected Graphs (Q5363015) (← links)
• Geometric <i>k</i> Shortest Paths (Q5363016) (← links)
• Triangulation Refinement and Approximate Shortest Paths in Weighted Regions (Q5363017) (← links)
• Optimal detection of intersections between convex polyhedra (Q5363018) (← links)
• Detecting Weakly Simple Polygons (Q5363019) (← links)
• Bayesian Truthful <i>Mechanisms</i> for Job Scheduling from Bi-criterion Approximation <i>Algorithms</i> (Q5363020) (← links)
• Welfare Maximization with Production Costs: A Primal Dual Approach (Q5363021) (← links)