Pages that link to "Item:Q1303785"
From MaRDI portal
The following pages link to A note on the approximation of a minimum-weight maximal independent set (Q1303785):
Displaying 16 items.
- On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
- Independent sets in graphs (Q501998) (← links)
- Approximating the minimum maximal independence number (Q685520) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Improved approximations for weighted and unweighted graph problems (Q2581009) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- On dp-minimality, strong dependence and weight (Q3173525) (← links)
- Approximations of Weighted Independent Set and Hereditary Subset Problems (Q4504997) (← links)
- (Q4845153) (← links)
- (Q4938668) (← links)