A remark on max-cut problem with an application to digital-analogue convertors |
| |
| Affiliation: | 1. UCL School of Pharmacy, Brunswick Square, London WC1N 1AX, United Kingdom;2. Department of Pharmaceutical Sciences, Mohanlal Shukhadia University, Udaipur, Rajasthan 313 001, India;3. Department of Pharmacology and Toxicology, KLE College of Pharmacy, KLE, Academy of Higher Education and Research (KAHER), Belagavi 590010, India;4. Department of Pharmacognosy and Phytochemistry, PES''s Rajaram and Tarabai Bandekar College of Pharmacy, Ponda, Goa University, Goa 403401, India;5. Department of Botany, A.V.V.M. Sri Pushpam College (Autonomous), Bharathidasan University, Poondi, Thanjavur 613 503, India;6. Department of Pharmaceutical Sciences, R.T.M. University, Nagpur, Maharashtra 440033, India;7. Regional Ayurveda Research Institute for Drug Development, Pune, Maharashtra, India;8. Sinhgad Technical Education Society''s, Smt. Kashibai Navale College of Pharmacy, Pune, Maharashtra, India;9. Department of Pharmacognosy and Phytochemistry, Goa College of Pharmacy, Panaji, Goa University, Goa- 403 001, India |
| |
| Abstract: | ![]()
We introduce notions of a distance-decreasing weight function and of an alternating cut. For a class of distance-decreasing weights we solve the max-cut problem. In general, we prove that alternating cuts are near optimal. This has application to digital-analogue convertors. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
