Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion-Reference-Cited by-同舟云学术

Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion

Published:2012 Issue: Volume: Page:76-87
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Boria Nicolas,Monnot Jérôme,Paschos Vangelis Th.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-28076-4_10

Reference17 articles.

1. 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

2. 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

3. Ausiello, G., Bonifaci, V., Escoffier, B.: Complexity and approximation in reoptimization. In: CiE 2007: Logic and Computation and Logic in the Real World (2007)

4. Lecture Notes in Computer Science;G. Ausiello,2006

5. Lecture Notes in Computer Science;D. Bilò,2008

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A note on the traveling salesman reoptimization problem under vertex insertion;Information Processing Letters;2015-03

2. Reoptimization in machine scheduling;Theoretical Computer Science;2014-06

3. REOPTIMIZATION UNDER VERTEX INSERTION: MAX Pk-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH;Discrete Mathematics, Algorithms and Applications;2013-06

4. A survey on combinatorial optimization in dynamic environments;RAIRO - Operations Research;2011-07