[Nrg-l] NRG Talk:09/29/2005

Vijay Erramilli evijay at cs.bu.edu
Mon Sep 26 11:06:48 EDT 2005

Hi All,

Nikos Laoutaris will talk on: 

"The Breakdown of the Object Placement Problem: Walking the Path from 
NP-hard to a Closed-Form Solution" , Abstract Follows

When: 11 am Thursday 09/29/2005
Where: Grad Lounge

Please come adequately caffeinated as this is a work in progress and the 
speaker would love your feedback!


We consider the hardness of deriving an optimal solution to the
object placement problem (OPP) and demonstrate its decline when
walking the path from the most general statement of the problem,
towards more specific cases that include simpler distance metrics
and details regarding the demand of the users. Along this path, we
present a greedy-optimal algorithm for the case of tightly
integrated groups of homogeneous users, as well as a closed-form
solution for the case of generalized power-law demand. These
solutions complete the spectrum of available solutions for the OPP
by filling missing parts towards the more specific instances of
the problem.

More information about the Nrg-l mailing list