Publications
Export 10 results:
Author Title Type [ Year] Filters: Keyword is Linear programming [Clear All Filters]
2007. Electron beam and optical proximity effect reduction for nanolithography: New results. Journal of Vacuum Science & Technology B. 25(6):2288-2294.
2006. An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences. 72(1):16-33.
2005. Algorithmic aspects of capacity in wireless networks. Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. :133-144.
2004. Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters. 32(5):473-478.
2001. Efficient algorithms for location and sizing problems in network design. IEEE Global Telecommunications Conference, 2001. GLOBECOM '01. 4:2586-2590vol.4-2586-2590vol.4.
2000. Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Mathematics of Operations ResearchMathematics of Operations Research. 25(2):255-280.
2000. Optimal design of signaling networks for Internet telephony. IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 2:707-716vol.2-707-716vol.2.
1997. A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :636-643.
1995. Going beyond integer programming with the Omega test to eliminate false data dependences. IEEE Transactions on Parallel and Distributed Systems. 6(2):204-211.