Pages that link to "Item:Q2383606"
From MaRDI portal
The following pages link to Approximation algorithm for hotlink assignment in the greedy model (Q2383606):
Displaying 6 items.
- On the complexity of optimal hotlink assignment (Q2428701) (← links)
- Optimal approximability of bookmark assignments (Q2444527) (← links)
- An Experimental Study of Recent Hotlink Assignment Algorithms (Q5233516) (← links)
- Structural Information and Communication Complexity (Q5315231) (← links)
- An experimental study of recent hotlink assignment algorithms (Q5406223) (← links)
- Algorithms and Data Structures (Q5900760) (← links)