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.
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← 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)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Fair division with multiple pieces (Q2192068) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Hyperfinite graphings and combinatorial optimization (Q2220974) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← links)
- New probabilistic upper bounds on the domination number of a graph (Q2318775) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- Sperner capacities (Q2366215) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- On the limits of depth reduction at depth 3 over small finite fields (Q2407087) (← links)
- Approximating set multi-covers (Q2408974) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Edge-covers in \(d\)-interval hypergraphs (Q2411826) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- New combinatorial structures with applications to efficient group testing with inhibitors (Q2426666) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Asymptotic values of the Hall-ratio for graph powers (Q2433717) (← links)
- Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
- On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
- How to guard a graph against tree moves (Q2445266) (← links)
- Sequential legislative lobbying (Q2450085) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Intersection reverse sequences and geometric applications. (Q2490864) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- Reconstruction of Kauffman networks applying trees (Q2497958) (← links)
- Empirical study of the greedy heuristic as applied to the link selection problem (Q2516854) (← links)
- Landmarks in graphs (Q2563921) (← links)
- Approximation algorithms for covering/packing integer programs (Q2575835) (← links)
- A list heuristic for vertex cover (Q2643795) (← links)
- Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
- Rigidity of proper colorings of \(\mathbb{Z}^d \) (Q2689658) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Interval packing and covering in the Boolean lattice (Q2785370) (← links)
- On some covering problems in geometry (Q2809209) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- Algorithmic techniques for maintaining shortest routes in dynamic networks (Q2864176) (← links)
- Coverings and matchings in \(r\)-partite hypergraphs (Q2913952) (← links)
- Randomized Online Algorithms for Set Cover Leasing Problems (Q2942379) (← links)
