Sciweavers

2050 search results - page 323 / 410
» constraints 2010
Sort
View
MICS
2010
102views more  MICS 2010»
13 years 6 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
MICS
2010
137views more  MICS 2010»
13 years 6 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
MIDDLEWARE
2010
Springer
13 years 6 months ago
Prometheus: User-Controlled P2P Social Data Management for Socially-Aware Applications
Recent Internet applications, such as online social networks and user-generated content sharing, produce an unprecedented amount of social information, which is further augmented b...
Nicolas Kourtellis, Joshua Finnis, Paul Anderson, ...
MP
2010
94views more  MP 2010»
13 years 6 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
MP
2010
99views more  MP 2010»
13 years 6 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...