Skip to main content

and
  1. No Access

    Article

    New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem

    In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present new approximation algorithms for it. This problem is a generalization of the...

    Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina in Algorithmica (2016)

  2. No Access

    Article

    Donation Center Location Problem

    We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theoretic problem. Given a set of age...

    Chien-Chung Huang, Zoya Svitkina in Algorithmica (2013)

  3. No Access

    Article

    Stochastic Models for Budget Optimization in Search-Based Advertising

    Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to determine how to place bids on the keywords of their interest in order to maximize their re...

    S. Muthukrishnan, Martin Pál, Zoya Svitkina in Algorithmica (2010)