54,547 research outputs found
Computing Socially-Efficient Cake Divisions
We consider a setting in which a single divisible good ("cake") needs to be
divided between n players, each with a possibly different valuation function
over pieces of the cake. For this setting, we address the problem of finding
divisions that maximize the social welfare, focusing on divisions where each
player needs to get one contiguous piece of the cake. We show that for both the
utilitarian and the egalitarian social welfare functions it is NP-hard to find
the optimal division. For the utilitarian welfare, we provide a constant factor
approximation algorithm, and prove that no FPTAS is possible unless P=NP. For
egalitarian welfare, we prove that it is NP-hard to approximate the optimum to
any factor smaller than 2. For the case where the number of players is small,
we provide an FPT (fixed parameter tractable) FPTAS for both the utilitarian
and the egalitarian welfare objectives
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
The multiway-cut problem is, given a weighted graph and k >= 2 terminal
nodes, to find a minimum-weight set of edges whose removal separates all the
terminals. The problem is NP-hard, and even NP-hard to approximate within
1+delta for some small delta > 0.
Calinescu, Karloff, and Rabani (1998) gave an algorithm with performance
guarantee 3/2-1/k, based on a geometric relaxation of the problem. In this
paper, we give improved randomized rounding schemes for their relaxation,
yielding a 12/11-approximation algorithm for k=3 and a 1.3438-approximation
algorithm in general.
Our approach hinges on the observation that the problem of designing a
randomized rounding scheme for a geometric relaxation is itself a linear
programming problem. The paper explores computational solutions to this
problem, and gives a proof that for a general class of geometric relaxations,
there are always randomized rounding schemes that match the integrality gap.Comment: Conference version in ACM Symposium on Theory of Computing (1999). To
appear in Mathematics of Operations Researc
Randomly Charged Polymers, Random Walks, and Their Extremal Properties
Motivated by an investigation of ground state properties of randomly charged
polymers, we discuss the size distribution of the largest Q-segments (segments
with total charge Q) in such N-mers. Upon mapping the charge sequence to
one--dimensional random walks (RWs), this corresponds to finding the
probability for the largest segment with total displacement Q in an N-step RW
to have length L. Using analytical, exact enumeration, and Monte Carlo methods,
we reveal the complex structure of the probability distribution in the large N
limit. In particular, the size of the longest neutral segment has a
distribution with a square-root singularity at l=L/N=1, an essential
singularity at l=0, and a discontinuous derivative at l=1/2. The behavior near
l=1 is related to a another interesting RW problem which we call the "staircase
problem". We also discuss the generalized problem for d-dimensional RWs.Comment: 33 pages, 19 Postscript figures, RevTe
- …