Quasi-bipartite graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Quasi-bipartite graph" in English language version.

refsWebsite

Global rank English rank

2^nd place

1,185^th place

840^th place

low place

11^th place

8^th place

acm.org

Rajagopalan, Sridhar; Vazirani, Vijay V. (1999), "On the bidirected cut relaxation for the metric Steiner tree problem", Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 742–751.
Robins, Gabriel; Zelikovsky, Alexander (2000), "Improved Steiner tree approximation in graphs", Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770–779.

Goemans, Michel; Olver, Neil; Rothvoss, Thomas; Zenklusen, Rico (2012). "Matroids and integrality gaps for hypergraphic steiner tree relaxations". Proceedings of the forty-fourth annual ACM symposium on Theory of computing. p. 1161-1176. doi:10.1145/2213977.2214081. ISBN 9781450312455. S2CID 13424446.

Rizzi, Romeo (2003), "On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic", Inf. Process. Lett., 86 (6): 335–338, doi:10.1016/S0020-0190(03)00210-2.
Chakrabarty, Deeparnab; Devanur, Nikhil R.; Vazirani, Vijay V. (2008), "New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem", Proc. 13th IPCO, Lecture Notes in Computer Science, vol. 5035, pp. 344–358, doi:10.1007/978-3-540-68891-4_24, ISBN 978-3-540-68886-0.
Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen (2001), "Lower Bounds for Approximation Algorithms for the Steiner Tree Problem", Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001, Lecture Notes in Computer Science, vol. 2204, Springer-Verlag, Lecture Notes in Computer Science 2204, pp. 217–228, doi:10.1007/3-540-45477-2_20, ISBN 978-3-540-42707-0.
Goemans, Michel; Olver, Neil; Rothvoss, Thomas; Zenklusen, Rico (2012). "Matroids and integrality gaps for hypergraphic steiner tree relaxations". Proceedings of the forty-fourth annual ACM symposium on Theory of computing. p. 1161-1176. doi:10.1145/2213977.2214081. ISBN 9781450312455. S2CID 13424446.
Gröpl, Clemens; Hougardy, Stefan; Nierhoff, Till; Prömel, Hans Jürgen (2002), "Steiner trees in uniformly quasi-bipartite graphs", Information Processing Letters, 83 (4): 195–200, doi:10.1016/S0020-0190(01)00335-0.

Goemans, Michel; Olver, Neil; Rothvoss, Thomas; Zenklusen, Rico (2012). "Matroids and integrality gaps for hypergraphic steiner tree relaxations". Proceedings of the forty-fourth annual ACM symposium on Theory of computing. p. 1161-1176. doi:10.1145/2213977.2214081. ISBN 9781450312455. S2CID 13424446.