169 search results - page 2 / 34» Distributed Approximation Algorithms for Finding 2-Edge-Conn... |

NETWORKS

2006

13 years 7 months ago
2006

Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...

SODA

2004

ACM

13 years 8 months ago
2004

ACM

Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...

ISAAC

2007

Springer

14 years 1 months ago
2007

Springer

The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...

APPROX

2008

Springer

13 years 9 months ago
2008

Springer

We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...

ICDE

2006

IEEE

14 years 8 months ago
2006

IEEE

Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...