( en | de | ru )

 

Disambiguation of "Hochbaum, Dorit S."

Author of the publication

copydeleteadd this publication to your clipboard
Instant Recognition of Half Integrality and 2-Approximations.

. APPROX, volume 1444 of Lecture Notes in Computer Science, page 99-110. Springer, (1998)

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.

Peter Dorittke

Kurt Hochbaum

Karin Hochbaum

Monika Hochbaum

Francisca Hochbaum

 

Other publications of authors with the same name

An efficient algorithm for image segmentation, Markov random fields and related problems.. J. ACM, 48 (4): 686-701 (2001)Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI, and . J. ACM, 32 (1): 130-136 (January 1985)Multiflow Transmission in Delay Constrained Cooperative Wireless Networks, , and . CoRR, (2012)A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach., and . FSTTCS, volume 241 of Lecture Notes in Computer Science, page 382-393. Springer, (1986)Ranking Sports Teams and the Inverse Equal Paths Problem.. WINE, volume 4286 of Lecture Notes in Computer Science, page 307-318. Springer, (2006)A New and Fast Approach to Very Large Scale Integrated Sequential Circuit Test Generation., and . Operations Research, 45 (6): 842-856 (1997)Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets., , and . ICPRAM, page 224-231. SciTePress, (2016)A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem, and . Operations Research, 57 (2): 358--376 (2009)About strongly polynomial time algorithms for quadratic optimization over submodular constraints., and . Math. Program., (1995)Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm.. CoRR, (2016)