Searching for "Erratum to "An approximation algorithm for maximum triangle packing" [Discrete Applied Mathematics 154 (2006) 971-979]." – sorted by Relevance.
575,693 documents found, showing 1 through 10.
Next 10 →
-
On Random Greedy Triangle Packing
- … The behaviour of the random greedy algorithm for constructing a maximal packing of edgedisjoint triangles on n…
- Cited by 1 (0 self) – Add To MetaCart
-
Packing triangles in low degree graphs and indifference graphs
- … and Schrijver (6) on the maximum k-set packing problem implies that the above algorithm is a ( 3 2 + ε)-approximation…
- Cited by 2 (0 self) – Add To MetaCart
-
ERRATUM
- …ERRATUM Apparently, there is an error in the proof of optimality of the algorithm presented…
- Add To MetaCart
-
Erratum
- …Erratum In the article “Algorithms for Chordal Analysis” by Bryan Pardo and William P. Birmingham…
- Add To MetaCart
-
erratum
- …Theoretical Computer Science 254 (2001) 691–694 www.elsevier.com/locate/tcs Erratum Corrigendum…
- Cited by 1 (0 self) – Add To MetaCart
-
Packing Edge Disjoint Triangles: A Parameterized View
- …. Further, the maximum number of triangles we can possibly add to the packing with the elements of H is |H…
- Cited by 4 (1 self) – Add To MetaCart
-
An Approximation Algorithm for Maximum Packing of 3-Edge Paths
- …An Approximation Algorithm for Maximum Packing of 3-Edge Paths 1 Refael Hassin, and Shlomi…
- Cited by 4 (2 self) – Add To MetaCart
-
Packing triangles in a graph and its complement
- … that the size of the maximum fractional packing of monochromatic triangles in 2-edge-coloring of Kn is always…
- Cited by 5 (0 self) – Add To MetaCart
-
Packing
- … cut packing problem and provide approximation algorithms for it. They used a linear programming…
- Add To MetaCart
-
Fast Approximation Algorithms for Fractional Packing and Covering Problems
- …Fast Approximation Algorithms for Fractional Packing and Covering Problems Serge A. Plotkin…
- Cited by 180 (13 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
