Abstract
In this paper, we study kernelization of Parameterized Max-Bisection above Tight Lower Bound problem, which is to find a bisection \((V_1, V_2)\) of G with at least \(\lceil |E|/2\rceil +k\) crossing edges for a given graph \(G=(V, E)\). The current best vertex kernel result for the problem is of size 16k. Based on analysis of the relation between maximum matching and vertices in Gallai-Edmonds decomposition of G, we divide graph G into a set of blocks, and each block in G is closely related to the number of crossing edges of bisection of G. By analyzing the number of crossing edges in all blocks, an improved vertex kernel of size 8k is presented.
This work is supported by the National Natural Science Foundation of China under Grants (61420106009, 61232001, 61472449, 61672536, 61572414).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Díaz, J., Kamiński, M.: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. Theor. Comput. Sci. 377(1–3), 271–276 (2007)
Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17(3), 449–467 (1965)
Feige, U., Karpiński, M., Langberg, M.: A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4), 181–188 (2001)
Frieze, A., Jerrum, M.: Improved approximation algorithms for max \(k\)-cut and max bisection. Algorithmica 18(1), 67–81 (1997)
Gutin, G., Yeo, A.: Note on maximal bisection above tight lower bound. Inf. Process. Lett. 110(21), 966–969 (2010)
Haglin, D.J., Venkatesan, S.M.: Approximation and intractability results for the maximum cut problem and its variants. IEEE Trans. Comput. 40(1), 110–113 (1991)
Halperin, E., Zwick, U.: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Struct. Algorithms 20(3), 382–402 (2002)
Jansen, K., Karpiński, M., Lingas, A., Seidel, E.: Polynomial time approximation schemes for max-bisection on planar and geometric graph. SIAM J. Comput. 35(1), 163–178 (2000)
Karpiński, M., Kowaluk, M., Lingas, A.: Approximation algorithms for max bisection on low degree regular graphs and planar graphs. Electron. Colloq. Comput. Complex. 7(7), 369–375 (2000)
Lovász, L., Plummer, M.D.: Matching Theory. NorthHolland, Amsterdam (1986)
Mnich, M., Zenklusen, R.: Bisections above tight lower bounds. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 184–193. Springer, Heidelberg (2012). doi:10.1007/978-3-642-34611-8_20
Ries, B., Zenklusen, R.: A 2-approximation for the maximum satisfying bisection problem. Eur. J. Oper. Res. 210(2), 169–175 (2011)
Ye, Y.: A 0.699-approximation algorithm for max-bisection. Math. Program. 90(1), 101–111 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Feng, Q., Zhu, S., Wang, J. (2017). A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound. In: Cao, Y., Chen, J. (eds) Computing and Combinatorics. COCOON 2017. Lecture Notes in Computer Science(), vol 10392. Springer, Cham. https://doi.org/10.1007/978-3-319-62389-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-62389-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62388-7
Online ISBN: 978-3-319-62389-4
eBook Packages: Computer ScienceComputer Science (R0)