Pages that link to "Item:Q1224109"

The following pages link to On the ratio of optimal integral and fractional covers (Q1224109):

Displaying 50 items.

• Algorithms for graphs with small octopus (Q1421464) (← links)
• Two sensitivity theorems in fuzzy integer programming. (Q1421465) (← links)
• Evaluation of reliability bounds by set covering models. (Q1424481) (← links)
• On homomorphisms from the Hamming cube to \(\mathbb{Z}\) (Q1425648) (← links)
• On the rigidity of Vandermonde matrices (Q1566747) (← links)
• Generalized submodular cover problems and applications (Q1589434) (← links)
• Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
• Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
• On a combinatorial framework for fault characterization (Q1616211) (← links)
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
• A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
• Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← links)
• A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
• The probabilistic minimum dominating set problem (Q1686054) (← links)
• Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl (Q1690259) (← links)
• New pairwise spanners (Q1693988) (← links)
• Saturating sets in projective planes and hypergraph covers (Q1699553) (← links)
• Greedy domination on biclique-free graphs (Q1730031) (← links)
• Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
• Towards flexible demands in online leasing problems (Q1750358) (← links)
• Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
• Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
• On the differential approximation of MIN SET COVER (Q1770405) (← links)
• Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
• Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
• Chromatic numbers of spheres (Q1783626) (← links)
• Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
• On the capacity of Boolean graph formulæ (Q1805371) (← links)
• Matchings and covers in hypergraphs (Q1813100) (← links)
• Bounds for optimal coverings (Q1827869) (← links)
• An analysis of the greedy algorithm for the submodular set covering problem (Q1838034) (← links)
• Approximating minimum cocolorings. (Q1853153) (← links)
• Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
• A fuzzy genetic algorithm for driver scheduling (Q1869717) (← links)
• Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
• Intersection number and capacities of graphs (Q1896353) (← links)
• Separation and approximation of polyhedral objects (Q1900992) (← links)
• Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
• On a theorem of Lovász on covers in \(r\)-partite hypergraphs (Q1924486) (← links)
• Strengthening hash families and compressive sensing (Q1932362) (← links)
• Renaming and the weakest family of failure detectors (Q1938384) (← links)
• An extension of Stein-Lovász theorem and some of its applications (Q1945692) (← links)
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
• On approximation of the submodular set cover problem (Q1969763) (← links)
• Online budgeted maximum coverage (Q1979466) (← links)
• Membership criteria and containments of powers of monomial ideals (Q2000797) (← links)
• Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
• Covering radius in the Hamming permutation space (Q2011145) (← links)
• Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
• Approximation algorithm for the multicovering problem (Q2025081) (← links)