Pages that link to "Item:Q5259598"

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

Displaying 50 items.

• Sensor placement for fault location identification in water networks: a minimum test cover approach (Q311945) (← links)
• On minimum maximal distance-\(k\) matchings (Q509288) (← links)
• Improved approximation algorithms for projection games (Q513283) (← links)
• Linear conic formulations for two-party correlations and values of nonlocal games (Q517312) (← links)
• Covering compact metric spaces greedily (Q722361) (← links)
• The ordered covering problem (Q722532) (← links)
• Hardness results of global Roman domination in graphs (Q831760) (← links)
• Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
• Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
• Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919) (← links)
• Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
• Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
• Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
• Greedy domination on biclique-free graphs (Q1730031) (← links)
• On directed covering and domination problems (Q1735678) (← links)
• Geometric hitting set for segments of few orientations (Q1743112) (← links)
• Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
• Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
• Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
• Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
• Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
• Optimal matroid partitioning problems (Q2032344) (← links)
• Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
• Approximation in (Poly-) logarithmic space (Q2037114) (← links)
• On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (Q2059873) (← links)
• Two-level hub Steiner trees (Q2059893) (← links)
• The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
• The minimum degree group Steiner problem (Q2065790) (← links)
• An improved approximation bound for minimum weight dominating set on graphs of bounded arboricity (Q2085734) (← links)
• MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence (Q2102080) (← links)
• Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
• Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
• A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
• On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
• On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
• Approximation algorithm and hardness results for defensive domination in graphs (Q2149875) (← links)
• Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
• Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586) (← links)
• Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
• System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
• Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
• Optimal facility location problem on polyhedral terrains using descending paths (Q2210515) (← links)
• Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)