Sciweavers

774 search results - page 35 / 155
» Factors of generalized Fermat numbers
Sort
View
COMGEO
1999
ACM
13 years 8 months ago
Point labeling with sliding labels
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
CSCW
2011
ACM
13 years 3 months ago
Scheduling in variable-core collaborative systems
The performance of a collaborative system depends on how two mandatory collaborative tasks, processing and transmission of user commands, are scheduled. We have developed multiple...
Sasa Junuzovic, Prasun Dewan
ICALP
2005
Springer
14 years 2 months ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...
FSTTCS
2010
Springer
13 years 6 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan