The following pages link to (Q4938668):
Displaying 10 items.
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- A note on the approximation of a minimum-weight maximal independent set (Q1303785) (← links)
- Approximating weighted neighborhood independent sets (Q1679903) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Competitive and collaborative influence in social networks (Q2422617) (← links)
- Improved approximations for weighted and unweighted graph problems (Q2581009) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- Approximations of Weighted Independent Set and Hereditary Subset Problems (Q4504997) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)