Referenzen
| 229. |
Inapproximability of dominating set on power law graphs
Theoretical Computer Science,
562:436-452
2015
|
| 228. |
Inapproximability of dominating set on power law graphs
Theoret. Comput. Sci.,
562:436--452
2015
|
| 227. |
Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs
J. Discrete Algorithms,
33:49--57
2015
|
| 226. |
New inapproximability bounds for TSP
J. Comput. System Sci.,
81(8):1665--1677
2015
|
| 225. |
On the Approximability of Independent Set Problem on Power Law Graphs
CoRR,
abs/1503.02880
2015
|
| 224. |
On the Complexity of Nondeterministically Testable Hypergraph Parameters
CoRR,
abs/1503.07093
2015
|
| 223. |
A QPTAS for the base of the number of crossing-free structures on a planar point set
Automata, languages, and programming. Part I Band 9134
aus Lecture Notes in Comput. Sci.
Seite 785--796.
Herausgeber: Springer, Heidelberg,
2015
|
| 222. |
Towards better inapproximability bounds for TSP: a challenge of global dependencies
Fundamentals of computation theory Band 9210
aus Lecture Notes in Comput. Sci.
Seite 3--11.
Herausgeber: Springer, Cham,
2015
|
| 221. |
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
CoRR,
abs/1411.0544
2014
|
| 220. |
Complexity of Nondeterministic Graph Parameter Testing
CoRR,
abs/1408.3590
2014
|
| 219. |
Deterministic polynomial factoring and association schemes
LMS J. Comput. Math.,
17(1):123--140
2014
|
| 218. |
Limits of CSP Problems and Efficient Parameter Testing
CoRR,
abs/1406.3514
2014
|