Tobias Tscheuschner und Settling - Info zur Person

(1 - 15 von 17

)

Smoothed Complexity of 2-FLIP in Local Max-CutColumbia University

www.cs.columbia.edu

— [ET11] Robert Elsässer and Tobias Tscheuschner. Settling the complexity of local max-cut (almost) completely. In International Colloquium on ...

Automata, Languages and Programming: 38th International Colloquium,...

books.google.de

Settling the Complexity of Local Max-Cut (Almost) Completely⋆ Robert Elsässer and Tobias Tscheuschner University of Paderborn Faculty of Computer Science ...

Settling the complexity of local max-cut (almost) completelyarXiv

arxiv.org

von R Elsaesser · · Zitiert von: 33 — From: Tobias Tscheuschner [view email] [v1] Thu, 29 Apr :53:00 UTC (366 KB) [v2] Fri, 5 Nov :51:06 UTC (326 KB)

Minimum Stable Cut and Treewidth - lamsadeUniversité Paris Dauphine-PSL

www.lamsade.dauphine.fr

Robert Elsässer and Tobias Tscheuschner. Settling the complexity of local max-cut (almost) completely. In Luca Aceto, Monika Henzinger, and Jirí Sgall, ...

[ v2] Settling the complexity of local max-cut (almost)...

arxiv.org

DBLP - CS Bibliography. listing | bibtex · Tobias Tscheuschner ... From: Tobias Tscheuschner [view email] [v1] Thu, 29 Apr :53:00 GMT (366kb,D) [v2] Fri ...

Sampling Frequency Thresholds for Quantum Advantage ...Research Square

www.researchsquare.com

von D Lykov · · Zitiert von: 3 — 48 Robert Elsässer and Tobias Tscheuschner, “Settling the complexity of local Max-Cut (almost) completely,” in.

Settling the Complexity of Local Max-Cut (Almost) Completely

link.springer.com

von R Elsässer · · Zitiert von: 26 — Settling the Complexity of Local Max-Cut (Almost) Completely. Robert Elsässer &; Tobias Tscheuschner. Conference paper Accesses. 5 Citations. von M Kirschner · · Zitiert von: 3 — Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. Matthias Kirschner,; Philipp Schengbier &; Tobias Tscheuschner. › chapter

Settling the Complexity of Local Max-Cut (Almost) Completely |...

link.springer.com

We co nsi der the problem of fi n di ng a local optimum for the Max-Cut problem with FLIP- neighborhoo d, i n which exactly o ne no de cha nges the partitio n....

au:Tscheuschner_T in:cs - SciRate Search

scirate.com

@misc{ , author = {Robert Elsaesser, Tobias Tscheuschner}, title = {{S}ettling the complexity of local max-cut (almost) completely}, year = {2010}, eprint ...

ICALP 2011

icalp11.inf.ethz.ch

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm; Robert Elsaesser and Tobias Tscheuschner. Settling the complexity of local max-cut (almost) completely; Georg Zetzsche. On the capabilities of grammars, automata, and transducers controlled by monoids; Nathalie ...