Pages that link to "Item:Q1224109"
From MaRDI portal
The following pages link to On the ratio of optimal integral and fractional covers (Q1224109):
Displaying 50 items.
- Random constructions and density results (Q1009013) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Linear programming bounds for codes via a covering argument (Q1017926) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- A note on two source location problems (Q1018105) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- An application of the greedy heuristic of set cover to traffic checks (Q1022400) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- The greedy algorithm for domination in graphs of maximum degree 3 (Q1029047) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- On qualitatively independent partitions and related problems (Q1051639) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Good coverings of Hamming spaces with spheres (Q1068057) (← links)
- Conditional covering: greedy heuristics and computational results (Q1091265) (← links)
- Cops and robbers in graphs with large girth and Cayley graphs (Q1092060) (← links)
- Near perfect coverings in graphs and hypergraphs (Q1092067) (← links)
- Codes with given distances (Q1094390) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- On the order of doubly transitive permutation groups (Q1160712) (← links)
- Extremal problems, partition theorems, symmetric hypergraphs (Q1170202) (← links)
- Approximation algorithms for hitting objects with straight lines (Q1173978) (← links)
- Complexity of the repeaters allocating problem (Q1183426) (← links)
- Parallel and serial heuristics for the minimum set cover problem (Q1186830) (← links)
- Processor optimization for flow graphs (Q1200808) (← links)
- The multicovering problem (Q1205691) (← links)
- Bounds for the covering number of a graph (Q1252353) (← links)
- Approximating MAPs for belief networks is NP-hard and other theorems (Q1274288) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632) (← links)
- Capacities: From information theory to extremal set theory (Q1337171) (← links)
- A theory for memory-based learning (Q1342731) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- A comparison of two lower-bound methods for communication complexity (Q1350995) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
