Approximation Algorithms for Finding Planar and Highly Connected Subgraphs

Approximation Algorithms for Finding Planar and Highly Connected Subgraphs (1997)

Cached

Download Links

[www.ime.usp.br]

by Cristina G. Fernandes

Citations:

1 - 0 self

BibTeX

@MISC{Fernandes97approximationalgorithms,
    author = {Cristina G. Fernandes},
    title = {Approximation Algorithms for Finding Planar and Highly Connected Subgraphs},
    year = {1997}
}

Bookmark

OpenURL

Abstract

Citations

1117	Reducability Among Combinatorial Problems - Karp - 1972
985	Graph Theory with Applications - Bondy, Murty - 1976
883	Graph theory - Harary - 1972
773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
636	The complexity of theorem-proving procedures - Cook - 1971
605	Proof Verification and the Hardness of Approximation Problems - Arora, Lund, et al. - 1998
577	Approximation algorithms for combinatorial problems - Johnson - 1974
505	Optimization, approximation, and complexity classes - Papadimitriou, Yannakakis - 1988
500	Approximation Algorithms for NP--hard Problems - Hochbaum - 1997
308	D.P.: A general approximation technique for constrained forest problems - Goemans, Williamson - 1995
242	Generalized first-order spectra and polynomial-time recognizable sets - Fagin - 1974
141	Sur le probleme des courbes gauches en topologie, Fund - Kuratowski - 1930
117	The Traveling Salesman Problem with Distances One and Two - Papadimitriou, Yannakakis - 1993
107	Approximation Algorithms For Set Covering And Vertex Cover Problem - Hochbaum - 1982
88	Automatic graph drawing and readability of diagrams - Tamassia, Battista, et al. - 1988
67	Biconnectivity approximations and graph carvings - Khuller, Vishkin - 1994
65	Improved approximation algorithms for network design problems - Goemans, SergePlotkin, et al. - 1994
58	Arboricity and subgraph listing algorithms - Chiba, Nishizeki - 1985
57	Random sampling in cut, flow, and network design problems - Karger - 1994
57	Improved Approximation Algorithms for Uniform Connectivity Problems - Raghavachari - 1995
50	An efficient approximate algorithm for survivable network design problems - Gabow, Goemans, et al. - 1993
38	Graph theory applications - Foulds - 1992
35	A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7 - Nagamochi, Ibaraki - 1992
31	Approximating minimum-size kconnected spanning subgraphs via matching - Cheriyan, Thurimella - 1996
30	Maximum planar subgraphs and nice embeddings: Practical layout tools - unger, Mutzel - 1993
29	On the deletion of nonplanar edges of a graph - Liu, Geldmacher - 1977
29	Computing near-optimal solutions to combinatorial optimization problems - Shmoys - 1995
28	Approximating the minimum equivalent digraph - Khuller, Raghavachari, et al. - 1995
26	A better approximation algorithm for finding planar graphs - Călinescu, Fernandes, et al. - 1998
26	To Weight or not to Weight: Where is the Question - Crescenzi, Silvestri, et al. - 1996
23	Ecken vom grad n in minimalen n-fach zusammenhangenden - Mader - 1972
20	Algorithms for parallel k-vertex connectivity and sparse certificates - Cheriyan, Thurimella - 1991
19	E cient algorithms for graphic matroid intersection and parity - Gabow, Stallman - 1985
18	On Sparse Subgraphs Preserving Connectivity Properties - Frank, Ibaraki, et al. - 1993
17	Minimale n-fach kantenzusammenhängende Graphen - Mader - 1971
14	Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques - Garg, Santosh, et al. - 1993
8	A linear algorithm for the maximal planar subgraph problem - Djidjev - 1995
8	Approximating the Value of Two-Prover Proof Systems, with Applications to MAX - Feige, Goemans - 1995
8	Techniques for the design of parallel graph algorithms - Thurimella - 1989
7	A new approximation algorithm for finding heavy planar subgraphs - Cǎlinescu, Fernandes, et al.
7	Analysis of heuristics for finding a maximum weight planar subgraph - Dyer, Foulds, et al. - 1985
6	A better approximation ratio for the minimum k-edge-connected spanning subgraph problem - Fernandes - 1997
6	Worst case analysis of memory allocation algorithms - Garey, Graham, et al. - 1972
5	Demonstratio Nonnullarum Insignium Proprietatum Quibus Solida Hedris Planis Inclusa Sunt Praedita - Euler
5	A linear time algorithm for finding a maximal planar subgraph based on PC-trees - Hsu - 2005
4	An analysis of some heuristics for the maximum planar subgraph problem - Cimikowski - 1995
3	Edge-Disjoint Branchings," in Combinatorial Algorithms - Edmonds - 1972
2	Tarjan, "An O(m log n)-time Algorithm for the Maximal Planar Subgraph Problem - Cai, Han, et al. - 1993
2	Minimal n-Fach Zusammenhangenden Digraphen - Mader - 1985
1	Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus - Calinescu, Fernandes - 1996