Abstract
We give a generalization of the method of pessimistic estimators [14], in which we compose estimators by multiplying them. We give conditions on the pessimistic estimators of two expectations, under which the product of the pessimistic estimators is a pessimistic estimator of the product of the two expectations. This approach can be useful when derandomizing algorithms for which one needs to bound a certain probability, which can be expressed as an intersection of multiple events; using our method, one can define pessimistic estimators for the probabilities of the individual events, and then multiply them to obtain a pessimistic estimator for the probability of the intersection of the events. We apply this method to give derandomizations of all known approximation algorithms for the maximum traveling salesman problem and the maximum triangle packing problem: we define simple pessimistic estimators based on the analysis of known randomized algorithms and show that we can multiply them to obtain pessimistic estimators for the expected weight of the solution. This gives deterministic algorithms with better approximation guarantees than what was previously known.
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
Barvinok, A., Johnson, D.S., Woeginger, G.J., Woodroofe, R.: The maximum traveling salesman problem under polyhedral norms. In: Bixby, R.E., Boyd, E.A., RÃos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 195–201. Springer, Heidelberg (1998)
Chen, Z.-Z.: Personal Communication (2009)
Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Inform. Process. Lett. 95(2), 333–342 (2005)
Chen, Z.-Z., Tanahashi, R.: A deterministic approximation algorithm for maximum 2-path packing. To appear in IEICE Transaction
Chen, Z.-Z., Tanahashi, R., Wang, L.: An improved randomized approximation algorithm for maximum triangle packing. Discrete Appl. Math. 157(7), 1640–1646 (2009); Preliminary version appeared in AAIM ’08
Chen, Z.-Z., Wang, L.: An improved randomized approximation algorithm for Max TSP. J. Comb. Optim. 9(4), 401–432 (2005)
ChlebÃk, M., ChlebÃková, J.: Approximation hardness for small occurrence instances of NP-hard problems. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 152–164. Springer, Heidelberg (2003)
Erdõs, P., Spencer, J.: Probabilistic methods in combinatorics. Academic Press, New York (1974); Probability and Mathematical Statistics, vol. 17
Hassin, R., Rubinstein, S.: Better approximations for max TSP. Inform. Process. Lett. 75(4), 181–186 (2000)
Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Appl. Math. 154(6), 971–979 (2006); Preliminary version appeared in ESA 2004
Hassin, R., Rubinstein, S.: Erratum to: An approximation algorithm for maximum triangle packing. Discrete Appl. Math. 154(6), 971–979 (2006); Discrete Appl. Math., 154(18), 2620 (2006)
Kowalik, L., Mucha, M.: Deterministic 7/8-approximation for the metric maximum tsp. Theoretical Computer Science 410, 5000–5009 (2009); Preliminary version appeard in APPROX-RANDOM ’08
Lovász, L., Plummer, M.D.: Matching theory. North-Holland Mathematics Studies, vol. 121. North-Holland Publishing Co, Amsterdam (1986); Annals of Discrete Mathematics, 29
Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37(2), 130–143 (1988)
Serdyukov, A.I.: An algorithm with an estimate for the travelling salesman problem of the maximum. Upravlyaemye Sistemy 89(25), 80–86 (1984)
Wigderson, A., Xiao, D.: Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications. Theory of Computing 4(1), 53–76 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Zuylen, A. (2010). Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-14031-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14030-3
Online ISBN: 978-3-642-14031-0
eBook Packages: Computer ScienceComputer Science (R0)