We consider the problem of reducing the edge lengths of a given network so that the modiied network has a spanning tree of small total length. It is assumed that each edge e of the given network has an associated function Ce that speciies the cost of shortening the edge by a given amount and that there is a budget B on the total reduction cost. The goal is to develop a reduction strategy satisf...

Protecting privacy in gradient-based learning has become increasingly critical as more sensitive information is being used. Many existing solutions seek to protect the gradients by constraining overall cost within a constant budget, where protection hand-designed and empirically calibrated boost utility of resulting model. However, it remains challenging choose proper adapted for specific const...

This paper considers problems of the following type: We are given an edge weighted graph G = (V;E). It is assumed that each edge e of the given network has an associated function ce that speci es the cost of shortening the edge by a given amount and that there is a budget B on the total reduction cost. The goal is to develop a reduction strategy satisfying the budget constraint so that the tota...

In contrast to the classical newsboy-style problem, this paper develops a model for the multiple-item budget-constraint newsboy problem considering a reservation policy to meet marketing needs. A discount rate is provided to those customers who are willing to make a reservation. In addition to the demand from the original customers, extra demand is also included in the model due to the motivati...

We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a specified number of facilities (i.e. a placement of a specified size) to minimize a function of one distance metric subject to a budget constraint on the other distance metric. Such problems arise in severa...

Grids enable sharing, selection and aggregation of geographically distributed resources among various organizations. They are emerging as promising computing paradigms for resource and computeintensive scientific workflow applications modeled as Directed Acyclic Graph (DAG) with intricate inter-task dependencies. With the growing popularity of real-time applications, streaming workflows continu...

In this paper we employ a cost indirect output distance function to model school district technology and measure performance. This function has the advantage of readily modeling multiple output production where that production is subject to a budget constraint. It also provides a natural measure of performance which is closely related to Fanell type measures of efficiency. We use this distance ...

In vehicular ad hoc networks, roadside units (RSUs) placement has been proposed to improve the the overall network performance in many ITS applications. This paper addresses the budget constrained and delay-bounded placement problem (BCDP) for roadside units in vehicular ad hoc networks. There are two types of RSUs: cable connected RSU (c-RSU) and wireless RSU (w-RSU). c-RSUs are interconnected...

In this paper, we study Resource Constrained Best Upgrade Plan (BUP) computation in road network databases. Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. In the single-pair version of BUP, the input includes a source and a de...