Pages that link to "Item:Q1281930"
From MaRDI portal
The following pages link to On approximation properties of the independent set problem for low degree graphs (Q1281930):
Displaying 37 items.
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- Large independent sets in random regular graphs (Q1034530) (← links)
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three (Q1123898) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q1196452) (← links)
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Minimizing the tracking error of cardinality constrained portfolios (Q1652503) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- Approximation algorithms for independent sets in map graphs (Q2765954) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
- Inapproximability of vertex cover and independent set in bounded degree graphs (Q3002828) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- On the Independence Number of Graphs with Maximum Degree 3 (Q3104780) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring (Q4381058) (← links)
- Improved approximations of independent sets in bounded-degree graphs via subgraph removal (Q4698692) (← links)
- Improved approximations of independent sets in bounded-degree graphs (Q5054761) (← links)
- Approximating maximum independent sets by excluding subgraphs (Q5056088) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- Structural Information and Communication Complexity (Q5315241) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- A probabilistic algorithm for vertex cover (Q6144024) (← links)
- Greedy approximations of independent sets in low degree graphs (Q6487957) (← links)
- Stackelberg security games with contagious attacks on a network: reallocation to the rescue (Q6488790) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
