Parameterized and approximation complexity of the detection pair problem in graphs

Florent Foucaud; Ralf Klasing

doi:10.7155/jgaa.00449

Parameterized and approximation complexity of the detection pair problem in graphs

Journal of Graph Algorithms and Applications ◽

10.7155/jgaa.00449 ◽

2017 ◽

Vol 21 (6) ◽

pp. 1039-1056

Author(s):

Florent Foucaud ◽

Ralf Klasing

Keyword(s):

Approximation Complexity

Download Full-text

Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_76 ◽

2005 ◽

pp. 862-873 ◽

Cited By ~ 13

Author(s):

Hassene Aissi ◽

Cristina Bazgan ◽

Daniel Vanderpooten

Keyword(s):

Shortest Path ◽

Spanning Tree ◽

Approximation Complexity

Download Full-text

Asymptotic analysis of average case approximation complexity of additive random fields

Journal of Complexity ◽

10.1016/j.jco.2018.04.001 ◽

2019 ◽

Vol 52 ◽

pp. 24-44 ◽

Cited By ~ 1

Author(s):

A.A. Khartov ◽

M. Zani

Keyword(s):

Asymptotic Analysis ◽

Random Fields ◽

Average Case ◽

Approximation Complexity

Download Full-text

Approximation complexity of Metric Dimension problem

Journal of Discrete Algorithms ◽

10.1016/j.jda.2011.12.010 ◽

2012 ◽

Vol 14 ◽

pp. 214-222 ◽

Cited By ~ 19

Author(s):

Mathias Hauptmann ◽

Richard Schmied ◽

Claus Viehmann

Keyword(s):

Metric Dimension ◽

Approximation Complexity

Download Full-text

More on Average Case vs Approximation Complexity

Computational Complexity ◽

10.1007/s00037-011-0029-x ◽

2011 ◽

Vol 20 (4) ◽

pp. 755-786 ◽

Cited By ~ 16

Author(s):

Michael Alekhnovich

Keyword(s):

Average Case ◽

Approximation Complexity

Download Full-text

On the Approximation Complexity Hierarchy

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-18318-8_4 ◽

2011 ◽

pp. 37-46 ◽

Cited By ~ 3

Author(s):

Magnus Bordewich

Keyword(s):

Approximation Complexity ◽

Complexity Hierarchy

Download Full-text

Approximation complexity of additive random fields

Journal of Complexity ◽

10.1016/j.jco.2007.11.002 ◽

2008 ◽

Vol 24 (3) ◽

pp. 362-379 ◽

Cited By ~ 10

Author(s):

M.A. Lifshits ◽

M. Zani

Keyword(s):

Random Fields ◽

Approximation Complexity

Download Full-text

Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements

Journal of Complexity ◽

10.1016/j.jco.2015.06.004 ◽

2015 ◽

Vol 31 (6) ◽

pp. 835-866 ◽

Cited By ~ 6

Author(s):

A.A. Khartov

Keyword(s):

Hilbert Space ◽

Asymptotic Analysis ◽

Average Case ◽

Random Elements ◽

Approximation Complexity

Download Full-text

More on average case vs approximation complexity

44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. ◽

10.1109/sfcs.2003.1238204 ◽

2004 ◽

Cited By ~ 32

Author(s):

M. Alekhnovich

Keyword(s):

Average Case ◽

Approximation Complexity

Download Full-text

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes

Journal of Discrete Algorithms ◽

10.1016/j.jda.2014.08.004 ◽

2015 ◽

Vol 31 ◽

pp. 48-68 ◽

Cited By ~ 12

Author(s):

Florent Foucaud

Keyword(s):

Dominating Sets ◽

Identifying Codes ◽

Graph Classes ◽

Approximation Complexity

Download Full-text

Parameterized and approximation complexity of Partial VC Dimension

Theoretical Computer Science ◽

10.1016/j.tcs.2018.09.013 ◽

2019 ◽

Vol 766 ◽

pp. 1-15 ◽

Cited By ~ 2

Author(s):

Cristina Bazgan ◽

Florent Foucaud ◽

Florian Sikora

Keyword(s):

Vc Dimension ◽

Approximation Complexity

Download Full-text