Pages that link to "Item:Q4074668"

The following pages link to Vertex packings: Structural properties and algorithms (Q4074668):

Displaying 50 items.

• Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
• On parameterized exponential time complexity (Q1029333) (← links)
• On problems without polynomial kernels (Q1034099) (← links)
• Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
• Random near-regular graphs and the node packing problem (Q1065829) (← links)
• Equivalent approximation algorithms for node cover (Q1077934) (← links)
• An algorithm to generate the ideals of a partial order (Q1086160) (← links)
• An exact threshold theorem for random graphs and the node-packing problem (Q1095150) (← links)
• Maximum weight independent set in trees (Q1101239) (← links)
• Maximal chordal subgraphs (Q1115455) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• Polytope des independants d'un graphe série-parallèle (Q1147168) (← links)
• Discrete extremal problems (Q1152306) (← links)
• Computing independent sets in graphs with large girth (Q1183338) (← links)
• A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
• A class of facet producing graphs for vertex packing polyhedra (Q1220520) (← links)
• A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
• A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
• Network flow and 2-satisfiability (Q1317481) (← links)
• The maximum clique problem (Q1318271) (← links)
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
• A rounding algorithm for integer programs (Q1327212) (← links)
• A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
• A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
• Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
• Binary integer programs with two variables per inequality (Q1363421) (← links)
• Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
• A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
• On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
• Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
• Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
• A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
• A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
• Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
• Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
• On upper bounds for the independent transversal domination number (Q1693131) (← links)
• The relationship between attribute reducts in rough sets and minimal vertex covers of graphs (Q1750334) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
• Approximating the dense set-cover problem (Q1765297) (← links)
• Parameterized (in)approximability of subset problems (Q1785218) (← links)
• Extended formulations for vertex cover (Q1790198) (← links)
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) (← links)
• A new greedoid: The family of local maximum stable sets of a forest (Q1850118) (← links)
• On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
• On the existence of subexponential parameterized algorithms (Q1877709) (← links)