Add to ORKGSuppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spanning subgraph of minimum cost. We present a polynomial time approximation scheme (PTAS) for this problem when the costs are uniform, or when the total cost of G is within a constant factor of the optimal.
We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show t...
The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of...
A 5/4-approximation algorithm is presented for the minimum cardinality 2-edge-connected spanning sub...
Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spanni...
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum ...
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighte...
We consider the problem of finding the minimum-weight subgraph that satisfies given connectivity req...
In this dissertation we consider combinatorial optimization problems. In particular, we concentrate ...
with Application to Subset TSP Let ɛ> 0 be a constant. For any edge-weighted planar graph G and a...
The maximum planar subgraph problem (MPSP) asks for a planar subgraph of a given graph with the maxi...
Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrai...
We give a 17 12-approximation algorithm for the following NP-hard problem: Given a simple undirected...
We give a 17 12 -approximation algorithm for the following NP-hard problem: Given an undirected gra...
AbstractThe problem of finding a two-connected planar spanning subgraph of maximum weight in a compl...
ABSTRACT: A t-spanner of an undirected, unweighted graph G is a spanning subgraph S of G with the ad...
We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show t...
The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of...
A 5/4-approximation algorithm is presented for the minimum cardinality 2-edge-connected spanning sub...
Suppose we are given a planar graph G with edge costs and we want to find a 2-edge-connected spanni...
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum ...
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighte...
We consider the problem of finding the minimum-weight subgraph that satisfies given connectivity req...
In this dissertation we consider combinatorial optimization problems. In particular, we concentrate ...
with Application to Subset TSP Let ɛ> 0 be a constant. For any edge-weighted planar graph G and a...
The maximum planar subgraph problem (MPSP) asks for a planar subgraph of a given graph with the maxi...
Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrai...
We give a 17 12-approximation algorithm for the following NP-hard problem: Given a simple undirected...
We give a 17 12 -approximation algorithm for the following NP-hard problem: Given an undirected gra...
AbstractThe problem of finding a two-connected planar spanning subgraph of maximum weight in a compl...
ABSTRACT: A t-spanner of an undirected, unweighted graph G is a spanning subgraph S of G with the ad...
We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show t...
The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of...
A 5/4-approximation algorithm is presented for the minimum cardinality 2-edge-connected spanning sub...