
Online Euclidean Spanners
In this paper, we study the online Euclidean spanners problem for points...
read it

Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm
The classical problem of maximizing a submodular function under a matroi...
read it

Optimal Streaming Approximations for all Boolean Max2CSPs
We prove tight upper and lower bounds on approximation ratios of all Boo...
read it

A Tight MaxFlow MinCut Duality Theorem for NonLinear Multicommodity Flows
The MaxFlow MinCut theorem is the classical duality result for the Max...
read it

Submodular maximization with uncertain knapsack capacity
We consider the maximization problem of monotone submodular functions un...
read it

When to Update the sequential patterns of stream data?
In this paper, we first define a difference measure between the old and ...
read it

Machine Covering in the RandomOrder Model
In the Online Machine Covering problem jobs, defined by their sizes, arr...
read it
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint
We consider the problem of maximizing a fractionally subadditive function under a knapsack constraint that grows over time. An incremental solution to this problem is given by an order in which to include the elements of the ground set, and the competitive ratio of an incremental solution is defined by the worst ratio over all capacities relative to an optimum solution of the corresponding capacity. We present an algorithm that finds an incremental solution of competitive ratio at most max{3.293√(M),2M}, under the assumption that the values of singleton sets are in the range [1,M], and we give a lower bound of max{2.449,M} on the attainable competitive ratio. In addition, we establish that our framework captures potentialbased flows between two vertices, and we give a tight bound of 2 for the incremental maximization of classical flows with unit capacities.
READ FULL TEXT
Comments
There are no comments yet.