Pages that link to "Item:Q3066157"
From MaRDI portal
The following pages link to On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs (Q3066157):
Displaying 7 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- Complexity and inapproximability results for the power edge set problem (Q1743493) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- On the hardness of optimization in power-law graphs (Q2481967) (← links)
- Hardness Results and Efficient Algorithms for Graph Powers (Q5851109) (← links)