Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Klein, Philip N.
5865  Ergebnisse:
Personensuche X
?
1

Correlation Clustering and Two-Edge-Connected Augmentation ..:

Klein, Philip N. ; Mathieu, Claire ; Zhou, Hang
Algorithmica.  , 2023
Link: https://doi.org/10.1007/..
 
?
2

A quasipolynomial (2 + ε)-approximation for planar sparsest..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Cohen-Addad, Vincent ; Gupta, Anupam ; Klein, Philip N.. - p. 1056-1069 , 2021
Link: https://dl.acm.org/doi/1..
 
?
3

On Light Spanners, Low-treewidth Embeddings and Efficient T..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Cohen-Addad, Vincent ; Filtser, Arnold ; Klein, Philip N.. - p. 589-600 , 2020
Link: https://doi.org/10.1109/..
 
?
4

The impact of highly compact algorithmic redistricting on t..:

, In: Proceedings of the 28th International Conference on Advances in Geographic Information Systems,
Wheeler, Archer ; Klein, Philip N. - p. 397-400 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

New hardness results for planar graph problems in p and an ..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Abboud, Amir ; Cohen-Addad, Vincent ; Klein, Philip N. - p. 996-1009 , 2020
Link: https://dl.acm.org/doi/1..
 
?
6

Local Search Yields Approximation Schemes for $k$-Means and..:

Cohen-Addad, Vincent ; Klein, Philip N. ; Mathieu, Claire
SIAM Journal on Computing.  48 (2019)  2 - p. 644-667 , 2019
Link: https://doi.org/10.1137/..
 
?
7

Embedding planar graphs into low-treewidth graphs with appl..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Fox-Epstein, Eli ; Klein, Philip N. ; Schild, Aaron - p. 1069-1088 , 2019
Link: https://dl.acm.org/doi/1..
 
?
8

A PTAS for Bounded-Capacity Vehicle Routing in Planar Graph:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Becker, Amariah ; Klein, Philip N. ; Schild, Aaron - p. 99-111 , 2019
Link: https://doi.org/10.1007/..
 
?
9

Balanced centroidal power diagrams for redistricting:

, In: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems,
Cohen-Addad, Vincent ; Klein, Philip N. ; Young, Neal E. - p. 389-396 , 2018
Link: https://dl.acm.org/doi/1..
 
?
10

Multiple-Source Multiple-Sink Maximum Flow in Directed Plan..:

Borradaile, Glencora ; Klein, Philip N. ; Mozes, Shay..
SIAM Journal on Computing.  46 (2017)  4 - p. 1280-1303 , 2017
Link: https://doi.org/10.1137/..
 
?
11

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium ..:

Klein, Philip N. , 2017
Link: https://dl.acm.org/doi/1..
 
?
12

Approximating connectivity domination in weighted bounded-g..:

, In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing,
Cohen-Addad, Vincent ; Colin de Verdière, Éric ; Klein, Philip N... - p. 584-597 , 2016
Link: https://dl.acm.org/doi/1..
 
?
13

A Polynomial-Time Approximation Scheme for Euclidean Steine..:

Borradaile, Glencora ; Klein, Philip N. ; Mathieu, Claire
ACM Transactions on Algorithms (TALG).  11 (2015)  3 - p. 1-20 , 2015
Link: https://dl.acm.org/doi/1..
 
?
14

A Polynomial-Time Approximation Scheme for Euclidean Steine..:

Borradaile, Glencora ; Klein, Philip N. ; Mathieu, Claire
ACM Transactions on Algorithms.  11 (2015)  3 - p. 1-20 , 2015
Link: https://doi.org/10.1145/..
 
?
15

A Polynomial-time Bicriteria Approximation Scheme for Plana..:

, In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing,
Fox, Kyle ; Klein, Philip N. ; Mozes, Shay - p. 841-850 , 2015
Link: https://dl.acm.org/doi/1..
 
1-15