( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation Algorithms.

, и . Algorithms and Theory of Computation Handbook, CRC Press, (1999)

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.

n n n

Johannes E M N Klein

n AÊ¿w n

N -L N Nguyen

n-hy n Yi

 

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

Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion., , и . ICALP, том 510 из Lecture Notes in Computer Science, стр. 751-762. Springer, (1991)Using router stamping to identify the source of IP packets., , и . ACM Conference on Computer and Communications Security, стр. 184-189. ACM, (2000)Computing the Edit-Distance between Unrooted Ordered Trees.. ESA, том 1461 из Lecture Notes in Computer Science, стр. 91-102. Springer, (1998)A polynomial-time approximation scheme for planar multiway cut., , , и . SODA, стр. 639-655. SIAM, (2012)On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting., , , , и . FORC, том 192 из LIPIcs, стр. 3:1-3:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Shape matching using edit-distance: an implementation., , и . SODA, стр. 781-790. ACM/SIAM, (2001)A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP., , , , и . SODA, стр. 33-41. ACM/SIAM, (1998)Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs., и . STOC, стр. 735-744. ACM, (2013)A quasipolynomial (2 + ε)-approximation for planar sparsest cut., , , и . STOC, стр. 1056-1069. ACM, (2021)A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights.. SIAM J. Comput., 37 (6): 1926-1952 (2008)