318 citations found. Retrieving documents...
D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Fast Approximation Schemes for Euclidean - Multi-Connectivity Problems..   (Correct)

No context found.

D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1996.


The Mathematics of Algorithm Design - Kleinberg   (Correct)

No context found.

D.S. Hochbaum (ed.). Approximation Algorithms for NP-hard Problems. PWS Publishing, 1996.


A Deterministic - Algorithm For Sat   (Correct)

No context found.

D. S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997.


An Approach for Automated Surgery Scheduling Karl-Heinz.. - Rwth Aachen University   (Correct)

No context found.

D. Hochbaum. Approximation Algorithms for NP-hard problems. PWS Publishing Company, 20 Park Plaza, Boston, MA 02116-4324, 1995.


Skeleton-Based Seam Computation for Triangulated Surface.. - Zhu, Hu, Martin (2003)   (Correct)

No context found.

Hochbaum S.: Approximation Algorithms for NP-hard Problems, PWS Publishing Company, 1997.


Fixed Parameter Algorithms for - Planar Dominating Set (2000)   (Correct)

No context found.

D. S. Hochbaum (ed.). Approximation algorithms for NP-hard problems. Boston, MA: PWS Publishing Company, 1997.


Clustering Short Time Series Gene Expression Data - Ernst, Nau, Bar-Joseph (2005)   (Correct)

No context found.

D.S. (Editor) Hochbaum. Approximation Algorithms for NPHard Problems. PWS Publishing Company, 1997.


Direct Routing: Algorithms and Complexity - Busch, Magdon-Ismail..   (Correct)

No context found.

Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, New York (1997)


Direct Routing: Algorithms and Complexity - Busch, Magdon-Ismail.. (2004)   (Correct)

No context found.

Dorit S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, New York, 1997.


Configuring Networks with Content Filtering - Nodes With Applications   (Correct)

No context found.

D. S. Hochbaum, ed., Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1997.


Fixing Inconsistent Databases by Updating Numerical.. - Leopoldo Bertossi Loreto   (Correct)

No context found.

Hochbaum, D. (ed.) Approximation Algorithms for NPHard Problems. PWS, 1997.


Complexity and Approximation of Fixing - Numerical Attributes In   (Correct)

No context found.

Hochbaum, D.(ed.) Approximation Algorithms for NP-Hard Problems. PWS, 1997.


Simultaneous Matchings - Elbassioni, Katriel, Kutz, Mahajan   (Correct)

No context found.

Dorit S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. Brooks/Cole Pub. Co., 1996.


Theoretical Computer Science 355 (2006) 25 -- 36 - Www Elsevier Com (2006)   (2 citations)  (Correct)

No context found.

D. Hochbaum, Approximation Algorithms for NP-Hard Problems, PWS Publishing Co., MA, 1997.


Probabilistic and Nondeterministic Unary Automata - Gramlich (2003)   (Correct)

No context found.

Hochbaum, D. (editor): Approximation algorithms for NP -hard problems, PWS Publishing Company, Boston, 1997.


Complexity and Approximation of Fixing - Numerical Attributes In   (Correct)

No context found.

Hochbaum, D.(ed.) Approximation Algorithms for NP-Hard Problems. PWS, 1997.


Complexity and Approximation of Fixing - Numerical Attributes In   (Correct)

No context found.

Hochbaum, D.(ed.) Approximation Algorithms for NP-Hard Problems. PWS, 1997.


Key Management for Restricted Multicast Using Broadcast.. - Abdalla, Shavitt, Wool (2000)   (7 citations)  (Correct)

No context found.

D. S. Hochbaum, Ed., Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS, 1995.


Design and Analysis of Secure Encryption Schemes - Abdalla (2001)   (Correct)

No context found.

D. S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1995.


Differential Approximation of NP-Hard Problems with Equal Size.. - Monnot   (Correct)

No context found.

D. Hochbaum, editor. Approximation algorithms for NP-hard problems. P.W.S, 1997.


Composition of modules' stock using Simulated Annealing - Catherine Da Cunha (2005)   (Correct)

No context found.

Dorit Hochbaum, Ed., Approximation algorithms for NP-hard problems, PWS publishing company, 1997.


Approximation Algorithms for the K-Center - Problem An Experimental   (Correct)

No context found.

Dorit S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS publishing company, Boston, 1995.


Facility Location and Covering Problems - Jurij Miheli University   (Correct)

No context found.

D. S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS publishing company, Boston, 1995.


Facility Location and Covering Problems - Jurij Mihelic And   (Correct)

No context found.

Dorit S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS publishing company, Boston, 1995.


Fixing Numerical Attributes under Integrity Constraints - Bertossi, Bravo.. (2004)   (Correct)

No context found.

Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems. PWS, 1997.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC