Harry B. Hunt, III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns  Home/Search
Context
Related
| uci.edu/~eppstein/...3Splanarsat.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: uci.edu/~eppstein/pubs/notmine... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present parallel approximation schemes for a large class of satisfiability and graph problems for planar and almost planar instances. Problems considered in this paper include optimization versions of classical NP-hard generalized CNF satisfiability problems and graph theoretic problems. The classes of graphs considered include planar graphs, planar hypergraphs, graphs of fixed genus, ffi-near-planar graphs and ffi -near-genus graphs. Our method for obtaining NC-approximation schemes is... (Update)
Similar documents based on text: More All
0.4: Complexity of Hierarchically and One-dimensional.. - Marathe, III.. (Correct)
0.4: Approximation Algorithms for PSPACE-Hard.. - Marathe, III.. (1998) (Correct)
0.3: Approximation Algorithms for Degree-Constrained.. - Ravi, Marathe.. (2001) (Correct)
BibTeX entry: (Update)
@misc{ hunt-parallel,
author = "Harry B. Hunt and III and Madhav V. Marathe and Venkatesh Radhakrishnan
and S. S. Ravi and Daniel J. Rosenkrantz and Richard E. Stearns",
title = "Parallel Approximation Schemes for Planar and Near-Planar Satisfiability
and Graph Problems",
url = "citeseer.ist.psu.edu/hunt96parallel.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
403 Proof Verification and Hardness of Approximation Problems - Arora, Lund et al. - 1992
300 the Hardness of Approximating Minimization Problems (context) - Lund, Yannakakis - 1994
293 Approximation Algorithms for Combinatorial Problems (context) - Johnson - 1974
267 Internetworking with TCP/IP (context) - Comer - 1991
149 Polynomial time Approximation Schemes for Dense Instances of.. - Arora, Karger et al. - 1995
145 Easy Problems for Tree-Decomposable Graphs - Arnborg, Lagergren et al. - 1991
127 The Complexity of Satisfiability Problems (context) - Schaefer - 1978
109 Efficient Algorithms for Combinatorial Problems on Graphs wi.. (context) - Arnborg - 1985
104 Applications of a Planar Separator Theorem (context) - Lipton, Tarjan - 1980
92 A Compendium of NP-Optimization Problems - Crescenzi, Kann - 1995
74 Approximation Schemes for Covering and Packing Problems in I.. (context) - Hochbaum, Maass - 1985
52 A Local Ratio Theorem for Approximating the Weighted Vertex .. (context) - Bar-Yehuda, Even - 1985
51 the Approximability of NP-complete Optimization Problems (context) - Kann - 1992
47 Optimization, Approximation and Complexity Classes (context) - Papadimitriou, Yannakakis - 1991
[Article contains additional citations not shown here]
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/notmine/): More
Average-Case Ray Shooting and Minimum Weight Triangulations - Aronov, Fortune (1997) (Correct)
Quasi-Greedy Triangulations Approximating the Minimum.. - Levcopoulos, Krznaric (1996) (Correct)
Lovász's Lemma for the Three-Dimensional K-Level of Concave.. - Katoh, Tokuyama (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC