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