Pages that link to "Item:Q1056763"
From MaRDI portal
The following pages link to Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763):
Displaying 50 items.
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Iterative improvement of vertex covers (Q672405) (← links)
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- On the complexity of the representation of simplicial complexes by trees (Q905846) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← 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 problems without polynomial kernels (Q1034099) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Equivalent approximation algorithms for node cover (Q1077934) (← links)
- Maximum weight independent set in trees (Q1101239) (← links)
- A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem (Q1129388) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs (Q1750334) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
- Why should biconnected components be identified first (Q1803675) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Relaxing the strong triadic closure problem for edge strength inference (Q1987174) (← links)
- Approximability of open \(k\)-monopoly problems (Q2048211) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem (Q2661992) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
- Dynamic Offline Conflict-Free Coloring for Unit Disks (Q3602844) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
