Pages that link to "Item:Q5259598"

The following pages link to Analytical approach to parallel repetition (Q5259598):

Displaying 50 items.

• Computing a tree having a small vertex cover (Q2272400) (← links)
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
• Algorithms for optimal replica placement under correlated failure in hierarchical failure domains (Q2290650) (← links)
• Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
• Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
• Whom to befriend to influence people (Q2292915) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Computational aspects of optimal strategic network diffusion (Q2304561) (← links)
• A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
• Computing a small agreeable set of indivisible items (Q2321268) (← links)
• Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
• Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
• A parallel repetition theorem for entangled projection games (Q2351389) (← links)
• The minimum \(k\)-storage problem on directed graphs (Q2355709) (← links)
• Approximability of guarding weak visibility polygons (Q2357167) (← links)
• Generalized threshold processes on graphs (Q2402258) (← links)
• Low-degree test with polynomially small error (Q2410685) (← links)
• Additive stabilizers for unstable graphs (Q2419360) (← links)
• From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
• Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• The matroid intersection cover problem (Q2661583) (← links)
• Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
• Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
• On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
• Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
• Unveiling the truth in liquid democracy with misinformed voters (Q2695433) (← links)
• Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs (Q2817864) (← links)
• Analysis of the parity progression ratios (Q2917489) (← links)
• Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems (Q2971170) (← links)
• Dynamic Sum-Radii Clustering (Q2980896) (← links)
• Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
• Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
• A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
• Improved Approximation Algorithm for Fault-Tolerant Facility Placement (Q3453283) (← links)
• The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
• Approximation algorithm for partial set multicover versus full set multicover (Q4634530) (← links)
• Parallel repetition via fortification: analytic view and the quantum case (Q4638072) (← links)
• (Q4638107) (← links)
• Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
• Information value of two-prover games (Q4993275) (← links)
• ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
• Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
• Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
• Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
• New Results on Directed Edge Dominating Set (Q5005171) (← links)
• (Q5009486) (← links)
• (Q5009492) (← links)
• A Tight Bound for Stochastic Submodular Cover (Q5009701) (← links)