The following pages link to (Q4737542):
Displaying 12 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)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem (Q2132409) (← links)
- Nonparametric advertising budget allocation with inventory constraint (Q2183869) (← links)
- Maximally representative allocations for guaranteed delivery advertising campaigns (Q2375891) (← links)
- Approximating the advertisement placement problem (Q2464430) (← links)
- Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms (Q2741488) (← links)
- A System Point Approach to Nonuniform Advertising Insertions (Q3313614) (← links)
- (Q4490819) (← links)
- Approximation algorithms for the MAXSPACE advertisement problem (Q6580082) (← links)
- Local-search based heuristics for advertisement scheduling (Q6658437) (← links)