Eyal Amir  Home/Search
Context
Related
| uiuc.edu/~eyal/pap...comp.1.0submit.ps Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~eyal/paper (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a polynomial-time approximation algorithm for finding O(log(OPT ))- approximation to treewidth. This is the first polynomial-time algorithm that approximates the optimal by a factor that does not depend on n.As a result, we get algorithms for finding pathwidth within a factor of O(log(OPT ) log(n)) from the optimal. We also present algorithms that approximate the treewidth of a graph by constant factors and are more e#cient than previously known algorithms, though still taking... (Update)
Similar documents (at the sentence level):
17.4%: Efficient Approximation for Triangulation of Minimum Treewidth - Amir (2001) (Correct)
Active bibliography (related documents): More All
0.9: Partition-Based Logical Reasoning for First-Order and.. - Amir, McIlraith (2000) (Correct)
0.6: The Leafage Of A Chordal Graph - Lin, McKee, West (Correct)
0.5: Improved Noise Tolerance for WalkSat - Chris Harris Nadya (Correct)
Similar documents based on text: More All
0.2: Interpolation Theorems for Nonmonotonic Reasoning Systems - Amir (2002) (Correct)
0.2: Learning Partially Observable Action Models - Amir (Correct)
0.2: Projection in Decomposed Situation Calculus - Amir (2002) (Correct)
BibTeX entry: (Update)
@misc{ amir-approximation,
author = "Eyal Amir",
title = "Approximation Algorithms for Treewidth",
url = "citeseer.ist.psu.edu/703458.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1989
582 Local computations with probabilities on graphical structure.. (context) - Lauritzen, Spiegelhalter - 1988
303 Princeton University Press (context) - Jr, Fulkerson et al. - 1962
209 Computer Science Press (context) - Algorithms - 1979
202 A linear-time algorithm for finding tree-decompositions of s.. - Bodlaender - 1996
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
141 Tree clustering for constraint networks (context) - Dechter, Pearl - 1989
140 Cyc: A large-scale investment in knowledge infrastructure - Lenat - 1995
103 Fast approximation algorithms for multicommodity flow proble.. - Leighton, Plotkin et al. - 1995
84 Bayesian updating in recursive graphical models by local com.. (context) - Jensen, Lauritzen et al. - 1990
73 Triangulated graphs and the elimination process (context) - Rose - 1974
54 Knowledge engineering for large belief networks (context) - Pradhan, Provan et al. - 1994
45 Proximity search in databases - Goldman, Shivakumar et al.
45 Approximation through multicommodity flow (context) - Klein, Agrawal et al. - 1990
44 Algorithm for solution of a problem of maximum flow in netwo.. (context) - Dinic - 1970
41 Finding approximate separators and computing tree width quic.. (context) - Reed - 1992
36 bounded treewidth and wellquasiordering (context) - Abrahamson, Fellows et al.
36 Problems easy for tree-decomposable graphs (context) - Arnborg, Lagergren et al. - 1991
26 Multiway cuts in directed and node weighted graphs - Garg, Vazirani et al. - 1994
25 and shortest elimination tree (context) - Bodlaender, Gilbert et al. - 1995
24 Finding minimal forbidden minors using a finite congruence (context) - Lagergren, Arnborg - 1991
17 Better algorithms for the pathwidth and treewidth of graphs (context) - Bodlaender, Kloks - 1991
17 Does prior knowledge facilitate the development of knowledge.. - Cohen, Chaudhri et al. - 1999
16 Treewidth: computations and approximations (context) - Kloks - 1994
14 Theorem proving with structured theories - McIlraith, Amir - 2001
14 Paritition-based logical reasoning (context) - Amir, McIlraith
13 The optimal multiterminal cut problem (context) - Cunningham - 1991
12 ciently fast algorithm for finding close to optimal junction.. (context) - Becker, Geiger et al. - 1996
8 A practical algorithm for finding optimal triangulations (context) - Shoikhet, Geiger - 1997
7 the disjoint paths problem (context) - XIII - 1995
7 A generalization of AT-free graphs and a generic algorithm f.. (context) - Broersma, Kloks et al. - 1998
7 An algorithm for determining whether the connectivity of a g.. (context) - Even - 1975
6 Complexity of finding embebdings in a K-tree (context) - Arnborg, Corneil et al. - 1987
6 II: algorithmic aspects of treewidth (context) - Robertson, Seymour et al. - 1986
3 On implementing the push-relabel method for the maximum flow.. (context) - Chekassky, Goldberg - 1997
2 Representations of chordal graphs as subtrees of a tree (context) - Walter - 1978
2 SATLIB - the satisfiability library (context) - Hoos, utzle - 2001
1 Journal of the ACM (context) - min-cut, their et al. - 1999
1 Fredrik Bajers Vej 7E (context) - Kjaerulff, of et al. - 1993
1 cient parallel algorithms for tree-decomposition and related.. (context) - Lagergren - 1990
Documents on the same site (http://www-faculty.cs.uiuc.edu/~eyal/paper.html): More
Projection in Decomposed Situation Calculus - Amir (2002) (Correct)
Interpolation Theorems for Nonmonotonic Reasoning Systems - Amir (2002) (Correct)
Formalizing Action Using Set Theory and Modified Pointwise.. - Amir (1997) (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