Arora, S., Karger, D., and Karpinski, M. 1995. Polynomial time approximation schemes for dense instances of NP-hard problems. In ACM Symposium on Theory of Computing. 284--293. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Segmentation Problems - Kleinberg, Papadimitriou, Raghavan (1998) (12 citations) (Correct)
No context found.
Arora, S., Karger, D., and Karpinski, M. 1995. Polynomial time approximation schemes for dense instances of NP-hard problems. In ACM Symposium on Theory of Computing. 284--293.
An FPT Algorithm for Set Splitting - Frank Dehne Michael (8 citations) (Correct)
No context found.
S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proc. ACM STOC, pages 284--293, 1995.
Energy Minimization via Graph Cuts: Settling What is Possible - Daniel Freedman And (1 citation) (Correct)
No context found.
S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 284--293, 1995.
Pass Ecient Algorithms for Approximating Large Matrices - Petros Drineas Drineas (2003) (Correct)
No context found.
S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NPhard problems. Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995.
Graph Algorithms for Planning and Partitioning - Chawla (2005) (Correct)
No context found.
S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of np-hard problems. JCSS, 58(1):193--210, 1999.
An FPT Algorithm for Set Splitting - Frank Dehne Michael (8 citations) (Correct)
No context found.
S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proc. ACM STOC, pages 284--293, 1995.
Polynomial Time Approximation Schemes for Geometric k-Clustering - Ostrovsky, Rabani (2001) (10 citations) (Correct)
No context found.
S. Arora, D. Karger, and M. Karpinski. Polynomial-time approximation schemes for dense instances of NP-hard problems. In Proc. 27th STOC, pp. 284-293, 1995.
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
The Method of Extremal Structure on the k-MAXIMUM CUT Problem - Prieto (2005) (Correct)
No context found.
S. Arora & D. Karger & M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, Proc. 27th Ann. ACM Symp. on Theory of Comp., (1995 ), pages 284--293
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