( en | de | ru )

 

Disambiguation of "Kaplan, Haim"

Author of the publication

copydeleteadd this publication to your clipboard
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems.

, , and . Math. Program., 92 (1): 1-36 (2002)

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.

Haim Taubenhaus

Gerhard Haim

Haim Abramowitsch

Gerhard Haim

Gerhard Haim

 

Other publications of authors with the same name

Path Minima in Incremental Unrooted Trees., and . ESA, volume 5193 of Lecture Notes in Computer Science, page 565-576. Springer, (2008)Optimal Cover of Points by Disks in a Simple Polygon., , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 475-486. Springer, (2010)Maximum Flows by Incremental Breadth-First Search., , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 457-468. Springer, (2011)Balanced-Replication Algorithms for Distribution Trees., and . ESA, volume 2461 of Lecture Notes in Computer Science, page 297-309. Springer, (2002)Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs., , , and . FOCS, page 56-65. IEEE Computer Society, (2003)On finding an optimal TCAM encoding scheme for packet classification., , , , and . INFOCOM, page 2049-2057. IEEE, (2013)Upward Max Min Fairness., , , , , , and . INFOCOM, page 837-845. IEEE, (2012)How to split a flow?, , , , and . INFOCOM, page 828-836. IEEE, (2012)Reachability Oracles for Directed Transmission Graphs., , , and . CoRR, (2016)Joint Cache Partition and Job Assignment on Multi-Core Processors, , and . CoRR, (2012)