Pages that link to "Item:Q2944511"
From MaRDI portal
The following pages link to Algorithmic construction of sets for <i>k</i> -restrictions (Q2944511):
Displayed 38 items.
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- Non-adaptive complex group testing with multiple positive sets (Q393127) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- Removing local extrema from imprecise terrains (Q419504) (← links)
- On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
- Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation (Q421476) (← links)
- Circulant graphs and GCD and LCM of subsets (Q477605) (← links)
- Video distribution under multiple constraints (Q551203) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- A note on systems with max-min and max-product constraints (Q835215) (← links)
- Tracing a single user (Q850073) (← links)
- Efficient sensor network design for continuous monitoring of moving objects (Q936530) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership (Q976067) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- Maximum subset intersection (Q1944892) (← links)
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets (Q1953061) (← links)
- Face-guarding polyhedra (Q2248737) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- A combinatorial approach to the design of vaccines (Q2339974) (← links)
- Reprint of: Face-guarding polyhedra (Q2341695) (← links)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Simplotopal maps and necklace splitting (Q2439120) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- Approximating Minimum Reset Sequences (Q3073634) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- Randomized Post-optimization for t-Restrictions (Q4915260) (← links)
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
- Polytopal complexes: maps, chain complexes and… necklaces (Q5301004) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← links)
- Manipulation in Games (Q5387771) (← links)
- On the Approximability of Combinatorial Exchange Problems (Q5459974) (← links)