Export 10 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is Linear programming  [Clear All Filters]
Peckerar M, Sander D, Srivastava A, Foli A, Vishkin U.  2007.  Electron beam and optical proximity effect reduction for nanolithography: New results. Journal of Vacuum Science & Technology B. 25(6):2288-2294.
Gandhi R, Halperin E, Khuller S, Kortsarz G, Srinivasan A.  2006.  An improved approximation algorithm for vertex cover with hard capacities. Journal of Computer and System Sciences. 72(1):16-33.
Kumar AVS, Marathe MV, Parthasarathy S, Srinivasan A.  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.
Kumaran K, Srinivasan A, Wang Q, Lanning S, Ramakrishnan KG.  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.
Baveja A, Srinivasan A.  2000.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Mathematics of Operations ResearchMathematics of Operations Research. 25(2):255-280.
Srinivasan A, Ramakrishnan KG, Kumaran K, Aravamudan M, Naqvi S.  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.
Srinivasan A, Teo C-P.  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.
Pugh W, Wonnacott D.  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.