Sciweavers

9842 search results - page 1674 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PODC
2006
ACM
16 years 1 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
16 years 1 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
SPAA
2006
ACM
16 years 1 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
FOCS
2005
IEEE
16 years 1 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
RTAS
2005
IEEE
16 years 1 months ago
Convoy Driving through Ad-Hoc Coalition Formation
— Convoy driving on public highways is a useful phenomena which increases the safety and the throughput of the highway. We present an approach through which a wireless Convoy Dri...
Majid Ali Khan, Ladislau Bölöni
« Prev « First page 1674 / 1969 Last » Next »