Pages that link to "Item:Q2464430"
From MaRDI portal
The following pages link to Approximating the advertisement placement problem (Q2464430):
Displayed 7 items.
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- Two for One: Tight Approximation of 2D Bin Packing (Q3183471) (← links)
- (Q5009517) (← links)
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING (Q5168419) (← links)