New online algorithms for story scheduling in web advertising

HIGHLIGHTS

• who: Susanne Albers from the Department of Computer Science, Technische Universität München, Boltzmannstr3, Garching, Germany have published the research: New Online Algorithms for Story Scheduling in Web Advertising, in the Journal: (JOURNAL)
• what: For this parallel setting √ the authors provide an algorithm whose competitive ratio is upper bounded by 1/(3 - ≈ for any β. The authors determine the best value of k. The authors evaluate the competitive ratio defined in Theo√ * * * rem 3. The authors show that 1/(1 - β 2k ) * * * and β 3k /(1 - β√k ) are√each upper bounded by c.
• future: A . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.