Sciweavers

204 search results - page 3 / 41
» Parameterized Complexity of Cardinality Constrained Optimiza...
Sort
View
JDA
2011
104views more  JDA 2011»
13 years 1 months ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 6 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
DAWAK
2008
Springer
13 years 8 months ago
Mining Conditional Cardinality Patterns for Data Warehouse Query Optimization
Abstract. Data mining algorithms are often embedded in more complex systems, serving as the provider of data for internal decision making within these systems. In this paper we add...
Mikolaj Morzy, Marcin Krystek
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
13 years 12 months ago
Online Bin Packing with Cardinality Constraints
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
Leah Epstein
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 9 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák