Abstract
Given a graph G = (V,E), a subset B ⊆ V of vertices is a weak odd dominated (WOD) set if there exists D ⊆ V ∖ B such that every vertex in B has an odd number of neighbours in D. κ(G) denotes the size of the largest WOD set, and κ′(G) the size of the smallest non-WOD set. The maximum of κ(G) and |V| − κ′(G), denoted κ Q (G), plays a crucial role in quantum cryptography. In particular deciding, given a graph G and k > 0, whether κ Q (G) ≤ k is of practical interest in the design of graph-based quantum secret sharing schemes. The decision problems associated with the quantities κ, κ′ and κ Q are known to be NP-Complete. In this paper, we consider the approximation of these quantities and the parameterized complexity of the corresponding problems. We mainly prove the fixed-parameter intractability (W[1]-hardness) of these problems. Regarding the approximation, we show that κ Q , κ and κ′ admit a constant factor approximation algorithm, and that κ and κ′ have no polynomial approximation scheme unless P=NP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Downey, R.G., Fellows, M.R., Vardy, A., Whittle, G.: The parameterized complexity of some fundamental problems in coding theory. SIAM J. on Comp. 29, 545–570
Gravier, S., Javelle, J., Mhalla, M., Perdrix, S.: On weak odd domination and graph-based quantum secret sharing. arXiv:1112.2495v2 (2011)
Golovach, P.A., Kratochvil, J., Suchy, O.: Parameterized complexity of generalized domination problems. Discrete Applied Mathematics 160(6), 780–792 (2009)
Halldórsson, M.M., Kratochvíl, J., Telle, J.A.: Mod-2 independence and domination in graphs. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 101–109. Springer, Heidelberg (1999)
Javelle, J., Mhalla, M., Perdrix, S.: New protocols and lower bound for quantum secret sharing with graph states. In: Kawano, Y. (ed.) TQC 2012. LNCS, vol. 7582, pp. 1–12. Springer, Heidelberg (2012)
Javelle, J., Mhalla, M., Perdrix, S.: On the minimum degree up to local complementation: Bounds and complexity. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 138–147. Springer, Heidelberg (2012)
Markham, D., Sanders, B.C.: Graph states for quantum secret sharing. Physical Review A 78(4) (2008)
Telle, J.A.: Complexity of domination-type problems in graphs. Nordic Journal of Computing 1(1), 157–171 (1994)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425–440 (1991)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial optimization problems and their approximability properties. Springer (1999)
Mahajan, M., Raman, V.: Parameterizing above Guaranteed Values: MaxSat and MaxCut. Journal of Algorithms 31(2), 335–354 (1999)
Raghavan, P.: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. of Comp. and Syst. Sciences 37(2), 130–143 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cattanéo, D., Perdrix, S. (2013). Parameterized Complexity of Weak Odd Domination Problems. In: Gąsieniec, L., Wolter, F. (eds) Fundamentals of Computation Theory. FCT 2013. Lecture Notes in Computer Science, vol 8070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40164-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-40164-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40163-3
Online ISBN: 978-3-642-40164-0
eBook Packages: Computer ScienceComputer Science (R0)