Results 1  10
of
209,391
Approximation Algorithms for the MaxMin Allocation problem
"... Abstract. The MaxMin allocation problem is to distribute indivisible goods to people so as to maximize the minimum utility of the people. We show a (2k − 1)approximation algorithm for MaxMin when there are k people with subadditive utility functions. We also give a k/αapproximation algorithm (fo ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Abstract. The MaxMin allocation problem is to distribute indivisible goods to people so as to maximize the minimum utility of the people. We show a (2k − 1)approximation algorithm for MaxMin when there are k people with subadditive utility functions. We also give a k/αapproximation algorithm
Combinatorial Algorithm for Restricted MaxMin Fair Allocation
, 2014
"... We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain configurationLP can be used to estima ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
to estimate the value of the optimal allocation to within a factor of 4 + ε. In contrast, however, the best known approximation algorithm for the problem has an unspecified large constant guarantee. In this paper we significantly narrow this gap by giving a 13approximation algorithm for the problem. Our
An Approximation Algorithm for MaxMin Fair Allocation of Indivisible goods
 In Proc. of the ACM Symposium on Theory of Computing (STOC
"... In this paper, we give the first approximation algorithm for the problem of maxmin fair allocation of indivisible goods. An instance of this problem consists of a set of k people and m indivisible goods. Each person has a known linear utility function over the set of goods which might be different ..."
Abstract

Cited by 58 (2 self)
 Add to MetaCart
In this paper, we give the first approximation algorithm for the problem of maxmin fair allocation of indivisible goods. An instance of this problem consists of a set of k people and m indivisible goods. Each person has a known linear utility function over the set of goods which might be different
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case. We conclude with some future work directions and open problems.
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Quasipolynomial local search for restricted maxmin fair allocation
 In Automata, Languages, and Programming
, 2012
"... Abstract. The restricted maxmin fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. [1] proved that a certain configuration ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. The restricted maxmin fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. [1] proved that a cer
New Approximation Algorithms for Degree Lowerbounded Arborescences and MaxMin Allocation
"... We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j, and the goal is to allocate items to players so as to maximize the minimum total valuation received by each player. The ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
the effect of bounded degree for items: each item has a nonzero value for at most D players. We show that essentially the case D = 3 is equivalent to the general case, and give a 4approximation algorithm for D = 2. The current algorithmic results for MaxMin Allocation are based on a complicated LP
Utility MaxMin: An ApplicationOriented Bandwidth Allocation Scheme
, 1999
"... In this paper, we consider the use of an applicationlayer performance measure  the utility  in the context of bandwidth allocation for an available bit rate service. Our bandwidth allocation scheme can be viewed as a generalization of traditional available bit rate service; our scheme is equi ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
is equivalent to bandwidth maxmin allocation when the utility of all applications are equal. The goal of our allocation scheme is to provide good applicationlayer service to a wide diversity of applications sharing available bandwidth. We achieve this goal while also supporting changes in utility over time
Supporting RealTime Applications in an Integrated Services Packet Network: Architecture and Mechanism
, 1992
"... This paper considers the support of realtime applications in an ..."
Abstract

Cited by 575 (25 self)
 Add to MetaCart
This paper considers the support of realtime applications in an
Integration of trade and disintegration of production in the global economy
 Journal of Economic Perspectives
, 1998
"... The last few decades have seen a spectacular integration of the global economy through trade. The rising integration of world markets has brought with it a disintegration of the production process, however, as manufacturing or services activities done abroad are combined with those performed at home ..."
Abstract

Cited by 485 (7 self)
 Add to MetaCart
decades have seen a spectacular integration of the global economy through trade. The share of imports (or exports) in GDP for the United States has approximately doubled in the last two decades, and if intraOECD trade is omitted, the same is true for the OECD countries generally. Trade does remain a
Results 1  10
of
209,391