( en | de | ru )

 

Disambiguation of "Klein, Philip N."

Author of the publication

copydeleteadd this publication to your clipboard
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.

, , , and . Combinatorica, 15 (2): 187-202 (1995)

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. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Johannes E M N Klein

n AÊ¿w n

N -L N Nguyen

n-hy n Yi

 

Other publications of authors with the same name

Shock-Based Indexing into Large Shape Databases., , and . ECCV (3), volume 2352 of Lecture Notes in Computer Science, page 731-746. Springer, (2002)Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs., , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 328-340. Springer, (2009)Approximation Through Local Optimality: Designing Networks with Small Degree., , and . FSTTCS, volume 652 of Lecture Notes in Computer Science, page 279-290. Springer, (1992)Solving Planar k -Terminal Cut in $O(n^c k)$ Time., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 569-580. Springer, (2012)Balanced power diagrams for redistricting., , and . CoRR, (2017)Multiple-source single-sink maximum flow in directed planar graphs in $O(n^1.5 n)$ time, and . CoRR, (2010)The power of local search for clustering., , and . CoRR, (2016)Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling., , and . SPAA, page 243-250. ACM, (1996)A subset spanner for Planar graphs, : with application to subset TSP.. STOC, page 749-756. ACM, (2006)A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs., and . WADS, volume 709 of Lecture Notes in Computer Science, page 442-451. Springer, (1993)