Graph orientation is a fundamental problem in graph theory that has recently arisen in the study of signaling-regulatory pathways in protein networks. Given a graph and a list of source-target vertex pairs, one wishes...
详细信息
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the...
详细信息
We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem. Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that min...
详细信息
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as being chores one needs to run, and th...
详细信息
Given a set P of n points in Rd and an integer k ≥ 1, let w* denote the minimum value so that P can be covered by k cylinders of radius at most (1 + Ε )w*. We describe an algorithm that, given P and an Ε> 0, com...
详细信息
We consider connectivity augmentation problems in the Steiner setting, where the goal is to augment the edge-connectivity between a specified subset of terminal nodes. In the Steiner Augmentation of a Graph problem (k...
详细信息
We study a network loading problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support flows a...
详细信息
Let G = (V, E) be an undirected graph with a capacity function u: E→R+ and let S1, S2,…, Sk be k commodities, where each Siconsists of a pair of nodes. A set S of nodes is called feasible if it contains no Si, and a...
详细信息
Many tasks in probabilistic reasoning can be cast as max-sum-product problems, a hard class of combinatorial problems. We describe our results in obtaining a new approximation scheme for the problem, that can be turne...
详细信息
ISBN:
(纸本)9781577356332
Many tasks in probabilistic reasoning can be cast as max-sum-product problems, a hard class of combinatorial problems. We describe our results in obtaining a new approximation scheme for the problem, that can be turned into an anytime procedure. For many tasks, this scheme can be shown to be asymptotically the best possible heuristic.
The link scheduling in wireless multi-hop networks is addressed. Different from most of work that adopt the protocol interference model which merely take consideration of packet collisions, our proposed algorithms use...
详细信息
暂无评论