FOCS

2008

IEEE

13 years 8 months ago
2008

IEEE

We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...

FOCS

2008

IEEE

13 years 8 months ago
2008

IEEE

Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...

FOCS

2008

IEEE

13 years 8 months ago
2008

IEEE

We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...

FOCS

2008

IEEE

13 years 8 months ago
2008

IEEE

The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...

FOCS

2008

IEEE

13 years 8 months ago
2008

IEEE

FOCS

2008

IEEE

13 years 9 months ago
2008

IEEE

We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the veriﬁer and the provers is quantum, but the provers are u...

FOCS

2008

IEEE

13 years 9 months ago
2008

IEEE

Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...

FOCS

2008

IEEE

13 years 9 months ago
2008

IEEE

In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...

FOCS

2008

IEEE

13 years 9 months ago
2008

IEEE

In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...

FOCS

2008

IEEE

13 years 9 months ago
2008

IEEE

We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...