Results 1  10
of
61,244
The PrizeCollecting
"... The prizecollecting generalized minimum spanning tree (PCGMST) is defined as follows: Given an undirected graph G = (V, E), with node set V, edge set E, cost vector c ∈ RE+ on the edges E, prize vector p ∈ RV + ..."
Abstract
 Add to MetaCart
The prizecollecting generalized minimum spanning tree (PCGMST) is defined as follows: Given an undirected graph G = (V, E), with node set V, edge set E, cost vector c ∈ RE+ on the edges E, prize vector p ∈ RV +
The PrizeCollecting Generalized Steiner Tree Problem Via A New Approach Of PrimalDual Schema
"... In this paper we study the prizecollecting version of the Generalized Steiner Tree problem. To the best of our knowledge, there is no general combinatorial technique in approximation algorithms developed to study the prizecollecting versions of various problems. These problems are studied on a cas ..."
Abstract

Cited by 47 (15 self)
 Add to MetaCart
In this paper we study the prizecollecting version of the Generalized Steiner Tree problem. To the best of our knowledge, there is no general combinatorial technique in approximation algorithms developed to study the prizecollecting versions of various problems. These problems are studied on a
Improved Approximation Algorithms for PRIZECOLLECTING STEINER TREE and TSP
"... Abstract — We study the prizecollecting versions of the Steiner tree, traveling salesman, and stroll (a.k.a. PATHTSP) problems (PCST, PCTSP, and PCS, respectively): given a graph (V, E) with costs on each edge and a penalty (a.k.a. prize) on each node, the goal is to find a tree (for PCST), cycle ..."
Abstract

Cited by 32 (6 self)
 Add to MetaCart
Abstract — We study the prizecollecting versions of the Steiner tree, traveling salesman, and stroll (a.k.a. PATHTSP) problems (PCST, PCTSP, and PCS, respectively): given a graph (V, E) with costs on each edge and a penalty (a.k.a. prize) on each node, the goal is to find a tree (for PCST), cycle
PRIZECOLLECTING POINT SETS
"... Abstract. Given a set of points P in the plane and profits (or prizes) π: P → R≥0 we want to select a maximum profit set X ⊆ P which maximizes P p∈X π(p) − µ(X) for some particular criterion µ(X). In this paper we consider four such criteria, namely the perimeter and the area of the smallest axisp ..."
Abstract
 Add to MetaCart
Abstract. Given a set of points P in the plane and profits (or prizes) π: P → R≥0 we want to select a maximum profit set X ⊆ P which maximizes P p∈X π(p) − µ(X) for some particular criterion µ(X). In this paper we consider four such criteria, namely the perimeter and the area of the smallest axis
A Technique for Improving Approximation Algorithms for PrizeCollecting Problems
, 2008
"... We study the prizecollecting versions of the Steiner tree (PCST) and traveling salesman (PCTSP) problems: given a graph (V, E) with costs on each edge and a penalty on each node, the goal is to find a tree (for PCST) or cycle (for PCTSP), that minimizes the sum of the edge costs in the tree/cycle a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the prizecollecting versions of the Steiner tree (PCST) and traveling salesman (PCTSP) problems: given a graph (V, E) with costs on each edge and a penalty on each node, the goal is to find a tree (for PCST) or cycle (for PCTSP), that minimizes the sum of the edge costs in the tree
Prizecollecting Survivable Network Design in Nodeweighted Graphs
"... We consider nodeweighted network design problems, in particular the survivable network design problem (SNDP) and its prizecollecting version (PCSNDP). The input consists of a nodeweighted undirected graph G = (V, E) and integral connectivity requirements r(st) for each pair of nodes st. The go ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We consider nodeweighted network design problems, in particular the survivable network design problem (SNDP) and its prizecollecting version (PCSNDP). The input consists of a nodeweighted undirected graph G = (V, E) and integral connectivity requirements r(st) for each pair of nodes st
PrizeCollecting Steiner Network Problems
"... In the Steiner Network problem we are given a graph G with edgecosts and connectivity requirements ruv between node pairs u, v. The goal is to find a minimumcost subgraph H of G that contains ruv edgedisjoint paths for all u, v ∈ V. In PrizeCollecting Steiner Network problems we do not need to ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
In the Steiner Network problem we are given a graph G with edgecosts and connectivity requirements ruv between node pairs u, v. The goal is to find a minimumcost subgraph H of G that contains ruv edgedisjoint paths for all u, v ∈ V. In PrizeCollecting Steiner Network problems we do not need
Euclidean Prizecollecting Steiner Forest
, 2009
"... In this paper, we consider Steiner forest and its generalizations, prizecollecting Steiner forest and kSteiner forest, when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we present a simpler analysis of the polynomialtime approxi ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
In this paper, we consider Steiner forest and its generalizations, prizecollecting Steiner forest and kSteiner forest, when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we present a simpler analysis of the polynomial
Results 1  10
of
61,244