( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Super-polynomial approximation branching algorithms.

, , и . RAIRO Oper. Res., 50 (4-5): 979-994 (2016)

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.

Panagiotis Paschos

Nikolaos Paschos

Ekaterini Paschos

Athanasios Paschos

Panagiōtēs G Paschos

 

Другие публикации лиц с тем же именем

Algorithms and Models for the On-Line Vertex-Covering., и . WG, том 2573 из Lecture Notes in Computer Science, стр. 102-113. Springer, (2002)On the Performance of Congestion Games for Optimum Satisfiability Problems., , , и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 220-231. Springer, (2007)Steiner Forests on Stochastic Metric Graphs., , и . COCOA, том 4616 из Lecture Notes in Computer Science, стр. 112-123. Springer, (2007)On the probabilistic minimum coloring and minimum k-coloring., и . Discret. Appl. Math., 154 (3): 564-586 (2006)Efficient algorithms for the max k-vertex cover problem., и . J. Comb. Optim., 28 (3): 674-691 (2014)An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs., , и . IWPEC, том 5018 из Lecture Notes in Computer Science, стр. 55-65. Springer, (2008)On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems., , и . IEEE Trans. Computers, 40 (12): 1413-1418 (1991)Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation., , и . CIAC, том 12701 из Lecture Notes in Computer Science, стр. 202-215. Springer, (2021)Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems., , , и . Theor. Comput. Sci., 147 (1&2): 267-298 (1995)Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation., , и . Theor. Comput. Sci., (2022)