Problems column

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Problems column

Full text

Pdf (59 KB)

Source

ACM Transactions on Algorithms (TALG) archive
Volume 2 , Issue 1 (January 2006) table of contents

Pages: 130 - 134

Year of Publication: 2006

ISSN:1549-6325

Author

Samir Khuller

University of Maryland, College Park, MD

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 51, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1125994.1126002 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Uriel Feige , Robert Krauthgamer, A Polylogarithmic Approximation of the Minimum Bisection, SIAM Journal on Computing, v.31 n.4, p.1090-1118, 2002 [doi>10.1137/S0097539701387660]
	2	Fishkin, A., Jansen, K., Sevastianov, S., and Sitters, R. 2005. Preemptive scheduling of independent jobs on identical parallel machines subject to migration delay. In Proceedings of the 13th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 3369. Springer Verlag.
	3	Graham, R. L., Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G. 1979. Optimization and approximation in deterministic scheduling: A survey. Ann. Disc. Math. 287--326.
	4	Hay, D., and Scalosub, G. 2005. Jitter regulation for multiple streams. In Proceedings of the 13th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 3369. Springer Verlag.
	5	Hayrapetyan, A., Kempe, D., Pal, M., and Svitkina, Z. 2005. Unbalanced graph cuts. In Proceedings of the 13th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 3369. Springer Verlag.
	6	Karp, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. Plenum Press, New York.
	7	Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., and Shmoys, D. B. 1993. Sequencing and scheduling: Algorithms and complexity. In Logistics of Production and Inventory. Volume 4 of Handbooks in Operation Research and Management Science. North-Holland, Amsterdam, The Netherlands, 445--522.
	8	Yishay Mansour , Boaz Patt-Shamir, Jitter control in QoS networks, IEEE/ACM Transactions on Networking (TON), v.9 n.4, p.492-502, August 2001 [doi>10.1109/90.944346]
	9	McNaughton, R. 1959. Scheduling with deadlines and loss functions. Manage. Sci. 6, 1--12.
	10	Svitkina, Z., and Tardos, E. 2004. Min-max multiway cut. In Proceedings of the 7th Workshop on Approximation Algorithms.