Skip to main content

7 Result(s)

within Zoya Svitkina Remove this filter

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

    Chapter and Conference Paper

    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 some new approximation algorithms for it. This problem is a generalization o...

    Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina in Algorithm Theory – SWAT 2012 (2012)

  4. 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)

  5. No Access

    Chapter and Conference Paper

    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 Internet and Network Economics (2007)

  6. No Access

    Chapter and Conference Paper

    Unbalanced Graph Cuts

    We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of nodes on the source side, subject to t...

    Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina in Algorithms – ESA 2005 (2005)

  7. No Access

    Chapter and Conference Paper

    Min-Max Multiway Cut

    We propose the Min-max multiway cut problem, a variant of the traditional Multiway cut problem, but with the goal of minimizing the maximum capacity (rather than the sum or average capacity) leaving a part of the...

    Zoya Svitkina, Éva Tardos in Approximation, Randomization, and Combinat… (2004)