Sciweavers

1110 search results - page 60 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
ALDT
2009
Springer
149views Algorithms» more  ALDT 2009»
15 years 3 months ago
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
Bart de Keijzer, Sylvain Bouveret, Tomas Klos, Yin...
ADC
2004
Springer
87views Database» more  ADC 2004»
15 years 4 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
ASPDAC
2001
ACM
102views Hardware» more  ASPDAC 2001»
15 years 2 months ago
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovs...
QOSIP
2005
Springer
15 years 4 months ago
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach
In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concep...
Tobias Harks
TAMC
2007
Springer
15 years 5 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...