Abstract
The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I′ resulting from a local perturbation of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve Π in I′, either optimally or by guaranteeing an approximation ratio better than that guaranteed by an ex nihilo computation and with running time better than that needed for such a computation. In this setting we study the weighted version of max weighted P k -free subgraph. We then show, how the technique we use allows us to handle also bin packing.
Research supported by the French Agency for Research under the DEFIS program TODO, ANR-09-EMER-010.
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
Archetti, C., Bertazzi, L., Speranza, M.: Reoptimizing the traveling salesman problem. Networks 42(3), 154–159 (2003), http://dblp.uni-trier.de/db/journals/networks/networks42.html#ArchettiBS03
Archetti, C., Bertazzi, L., Speranza, M.: Reoptimizing the 0-1 knapsack problem. Discrete Applied Mathematics 158(17), 1879–1887 (2010), http://dblp.uni-trier.de/db/journals/dam/dam158.html#ArchettiBS10
Ausiello, G., Bonifaci, V., Escoffier, B.: Complexity and approximation in reoptimization. In: CiE 2007: Logic and Computation and Logic in the Real World (2007)
Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 196–207. Springer, Heidelberg (2006), http://dblp.uni-trier.de/db/conf/swat/swat2006.html#AusielloEMP06
Bilò, D., Böckenhauer, H.-J., Hromkovič, J., Královič, R., Mömke, T., Widmayer, P., Zych, A.: Reoptimization of Steiner Trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 258–269. Springer, Heidelberg (2008), http://dblp.uni-trier.de/db/conf/swat/swat2008.html#BiloBHKMWZ08
Bilò, D., Böckenhauer, H.-J., Komm, D., Královič, R., Mömke, T., Seibert, S., Zych, A.: Reoptimization of the Shortest Common Superstring Problem. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol. 5577, pp. 78–91. Springer, Heidelberg (2009)
Bilò, D., Widmayer, P., Zych, A.: Reoptimization of Weighted Graph and Covering Problems. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 201–213. Springer, Heidelberg (2009), http://dblp.uni-trier.de/db/conf/waoa/waoa2008.html#BiloWZ08
Böckenhauer, H.J., Forlizzi, L., Hromkovic, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: On the approximability of tsp on local modifications of optimally solved instances. Algorithmic Operations Research 2(2), 83–93 (2007), http://dblp.uni-trier.de/db/journals/aor/aor2.html#BockenhauerFHKKPW07
Böckenhauer, H.J., Hromkovic, J., Královic, R., Mömke, T., Rossmanith, P.: Reoptimization of steiner trees: Changing the terminal set. Theor. Comput. Sci. 410(36), 3428–3435 (2009), http://dblp.uni-trier.de/db/journals/tcs/tcs410.html#BockenhauerHKMR09
Böckenhauer, H.-J., Hromkovič, J., Mömke, T., Widmayer, P.: On the Hardness of Reoptimization. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 50–65. Springer, Heidelberg (2008), http://dblp.uni-trier.de/db/conf/sofsem/sofsem2008.html#BockenhauerHMW08
Böckenhauer, H.-J., Hromkovič, J., Sprock, A.: Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. In: Kelemen, J., Kelemenová, A. (eds.) Computation, Cooperation, and Life. LNCS, vol. 6610, pp. 7–15. Springer, Heidelberg (2011)
Böckenhauer, H.J., Komm, D.: Reoptimization of the metric deadline TSP. J. Discrete Algorithms 8(1), 87–100 (2010), http://dblp.uni-trier.de/db/journals/jda/jda8.html#BockenhauerK10
Boria, N., Monnot, J., Paschos, V.T.: Reoptimization of maximum weight induced hereditary subgraph problems. Cahier du LAMSADE 311, LAMSADE, University Paris-Dauphine (Juin 2001)
Boria, N., Paschos, V.: Fast reoptimization for the minimum spanning tree problem. Journal of Discrete Algorithms 8(3), 296–310 (2010)
Escoffier, B., Milanic, M., Paschos, V.: Simple and fast reoptimizations for the steiner tree problem. Algorithmic Operations Research 4(2), 86–94 (2009), http://dblp.uni-trier.de/db/journals/aor/aor4.html#EscoffierMP09
Lund, C., Yannakakis, M.: The Approximation of Maximum Subgraph Problems. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol. 700, pp. 40–51. Springer, Heidelberg (1993)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proc. STOC 2006, pp. 681–690 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boria, N., Monnot, J., Paschos, V.T. (2012). Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. In: Rahman, M.S., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2012. Lecture Notes in Computer Science, vol 7157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28076-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-28076-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28075-7
Online ISBN: 978-3-642-28076-4
eBook Packages: Computer ScienceComputer Science (R0)