10 research outputs found
New Query Lower Bounds for Submodular Function Minimization
We consider submodular function minimization in the oracle model: given
black-box access to a submodular set function , find an element of using as few queries to
as possible. State-of-the-art algorithms succeed with
queries [LeeSW15], yet the best-known lower bound has never
been improved beyond [Harvey08].
We provide a query lower bound of for submodular function minimization,
a query lower bound for the non-trivial minimizer of a symmetric
submodular function, and a query lower bound for the non-trivial
minimizer of an asymmetric submodular function.
Our lower bound results from a connection between SFM lower bounds
and a novel concept we term the cut dimension of a graph. Interestingly, this
yields a cut-query lower bound for finding the global mincut in an
undirected, weighted graph, but we also prove it cannot yield a lower bound
better than for - mincut, even in a directed, weighted graph
Air pollution from household solid fuel combustion in India: an overview of exposure and health related information to inform health research priorities
Environmental and occupational risk factors contribute to nearly 40% of the national burden of disease in India, with air pollution in the indoor and outdoor environment ranking amongst leading risk factors. It is now recognized that the health burden from air pollution exposures that primarily occur in the rural indoors, from pollutants released during the incomplete combustion of solid fuels in households, may rival or even exceed the burden attributable to urban outdoor exposures. Few environmental epidemiological efforts have been devoted to this setting, however. We provide an overview of important available information on exposures and health effects related to household solid fuel use in India, with a view to inform health research priorities for household air pollution and facilitate being able to address air pollution within an integrated ruralāurban framework in the future