Jump to content

Baker's technique: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
AnomieBOT (talk | contribs)
m Dating maintenance tags: {{Orphan}}
References: authorlink Hans L. Bodlaender; remove whitespace
Line 33: Line 33:
| issue = 1
| issue = 1
| year = 1994}}.
| year = 1994}}.

* {{citation
* {{citation
| last = Bodlaender| first = H.
| last = Bodlaender| first = H. | authorlink = Hans L. Bodlaender
| journal = ICALP
| journal = ICALP
| title = Dynamic programming on graphs with bounded treewidth
| title = Dynamic programming on graphs with bounded treewidth
| year = 1988}}.
| year = 1988}}.

* {{citation
* {{citation
| last1 = Demaine|first1 = E.|authorlink= Erik Demaine|last2 = Hajiaghayi|first2 = M.|last3 = Kawarabayashi|first3 = K.
| last1 = Demaine|first1 = E.|authorlink= Erik Demaine|last2 = Hajiaghayi|first2 = M.|last3 = Kawarabayashi|first3 = K.
Line 46: Line 44:
| volume = 46
| volume = 46
| year = 2005}}.
| year = 2005}}.

* {{citation
* {{citation
| last1 = Demaine|first1 = E.|authorlink= Erik Demaine|last2 = Hajiaghayi| first2 = M.|last3 = Nishimura|first3 = N.|last4 = Ragde|first4 = P.|last5 = Thilikos|first5 = D.
| last1 = Demaine|first1 = E.|authorlink= Erik Demaine|last2 = Hajiaghayi| first2 = M.|last3 = Nishimura|first3 = N.|last4 = Ragde|first4 = P.|last5 = Thilikos|first5 = D.
Line 53: Line 50:
| volume = 69
| volume = 69
| year = 2004}}.
| year = 2004}}.

* {{citation
* {{citation
| last = Eppstein| first = D.
| last = Eppstein| first = D.
Line 61: Line 57:
| volume = 27
| volume = 27
| year = 2000}}.
| year = 2000}}.

* {{citation
* {{citation
| last = Eppstein| first = D.
| last = Eppstein| first = D.

Revision as of 22:15, 18 February 2012

Baker's technique, created in 1994 by Brenda Baker, is a method for designing polynomial-time approximation schemes, PTASs, for problems on planar graphs. This technique has given PTASs for the following problems: subgraph isomorphism, maximum independent set, minimum vertex cover, minimum dominating set, minimum edge dominating set, maximum triangle matching, and many others. Its generalizations have also led to many PTASs on graphs excluding a fixed minor, and bounded genus graphs. The idea for Baker's technique is to break the graph into layers, such that the problem can be solved optimally on each layer, then combine the solutions from each layer in a reasonable way that will result in a feasible solution.

Example of technique

The example that we will use to demonstrate Baker's technique is the maximum weight independent set problem.

Algorithm

INDEPENDENT-SET(,,)
Choose an arbitrary vertex 

find the breadth-first search levels for  rooted at  : 
for 
find the components  of  after deleting 
for 
compute , the maximum-weight independent set of 

let  be the solution of maximum weight among 
return 

Notice that the above algorithm is feasible because each is the union of disjoint independent sets.

Dynamic programming

Dynamic programming is used when we compute the maximum-weight independent set for each . This dynamic program works because each is a -outerplanar graph. Many NP-complete problems can be solved with dynamic programming on -outerplanar graphs.

References

  • Baker, B. (1994), "Approximation algorithms for NP-complete problems on planar graphs", JACM, 41 (1).
  • Bodlaender, H. (1988), "Dynamic programming on graphs with bounded treewidth", ICALP.
  • Demaine, E.; Hajiaghayi, M.; Kawarabayashi, K. (2005), "Algorithmic graph minor theory: Decomposition, approximation, and coloring", FOCS, 46.
  • Demaine, E.; Hajiaghayi, M.; Nishimura, N.; Ragde, P.; Thilikos, D. (2004), "Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.", J. Comput. Syst. Sci., 69.
  • Eppstein, D. (2000), "Diameter and treewidth in minor-closed graph families.", Algorithmica, 27.
  • Eppstein, D. (1995), "Subgraph isomorphism in planar graphs and related problems.", SODA, 6.