( en | de | ru )

 

Disambiguation of "Bazgan, Cristina"

Author of the publication

copydeleteadd this publication to your clipboard
Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping.

, , , , and . AAAI, page 12381-12389. AAAI Press, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Cristina Häring

Cristina Sattarhoff

Cristina Niculescu

Cristina Gomes

Cristina Cozzini

 

Other publications of authors with the same name

Covering a Graph with a Constrained Forest (Extended Abstract)., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 892-901. Springer, (2009)Completeness in Differential Approximation Classes., , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 179-188. Springer, (2003)Differential Approximation for Some Routing Problems., , and . CIAC, volume 2653 of Lecture Notes in Computer Science, page 277-288. Springer, (2003)A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem., , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 717-728. Springer, (2007)Approximating Multiobjective Optimization Problems: How exact can you be?, , , , and . CoRR, (2023)Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack., , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 862-873. Springer, (2005)Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping., , , , and . AAAI, page 12381-12389. AAAI Press, (2023)Approximation of min-max and min-max regret versions of some combinatorial optimization problems., , and . Eur. J. Oper. Res., 179 (2): 281-290 (2007)Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems., , and . COCOA (1), volume 6508 of Lecture Notes in Computer Science, page 237-251. Springer, (2010)Finding a potential community in networks., , and . Theor. Comput. Sci., (2019)