{"product_id":"nezawisimoe-mnozhestwo-naibolshej-moschnosti-polinomialnyj-algoritm-von-murat-huseewich-dudow","title":"Nezawisimoe mnozhestwo naibol'shej moschnosti","description":"\u003cp\u003ePredlagaetsq metod postroeniq maximal'nogo nezawisimogo mnozhestwa naibol'shej moschnosti, wychislitel'naq slozhnost' kotorogo polinomial'na. Zadachu o maximal'nom nezawisimom mnozhestwe naibol'shej moschnosti prinqto otnosit' k klassu NP-polnyh w oblasti teorii grafow. Pokazano, chto dlq rassmatriwaemoj zadachi otsechenie Gomori sowpadaet s ogranicheniem, sootwetstwuüschim odnomu iz ciklow nechötnoj dliny. Predlagaemyj algoritm i osobennosti rassmatriwaemoj zadachi, otlichaüschie eö ot obschej zadachi linejnogo programmirowaniq, pozwolqüt postroit' algoritmy s polinomial'noj wychislitel'noj slozhnost'ü.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783330036369\"\u003e\u003ch3\u003ePolinomial'nyj algoritm\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9783330036369","offer_id":39421977460829,"sku":"9783330036369","price":26.9,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/0487cbc1-9bd1-4b5e-beb6-899c76b10b21.jpg?v=1773466261","url":"https:\/\/shop.autorenwelt.de\/products\/nezawisimoe-mnozhestwo-naibolshej-moschnosti-polinomialnyj-algoritm-von-murat-huseewich-dudow","provider":"Autorenwelt Shop","version":"1.0","type":"link"}