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 50 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Give-and-take based peer-to-peer content distribution networks (Q301622) (← links)
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- Towards the price of leasing online (Q346515) (← links)
- 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)
- A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← 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)
- On the approximability of covering points by lines and related problems (Q904111) (← 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)
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks (Q1662465) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← 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)
- Online budgeted maximum coverage (Q1979466) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- \(O_n\) is an \(n\)-MCFL (Q2121469) (← links)
- Deterministic constructions of high-dimensional sets with small dispersion (Q2149098) (← 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)
- Bounds on upper transversals in hypergraphs (Q2292129) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- A combinatorial approach to the design of vaccines (Q2339974) (← links)
- Reprint of: Face-guarding polyhedra (Q2341695) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Fair splitting of colored paths (Q2401427) (← links)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Simplotopal maps and necklace splitting (Q2439120) (← links)