ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ Ρ ΠΎΡΠ΅Π½ΠΊΠ°ΠΌΠΈ Π΄Π»Ρ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΡΡ Π·Π°Π΄Π°Ρ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ
Π§ΠΈΡΠ»ΠΎ ΡΠ°Π·Π»ΠΈΡΠ½ΡΡ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΡ ΠΏΠΎΡΡΠ°Π½ΠΎΠ²ΠΎΠΊ, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΌΠΎΠΆΠ½ΠΎ ΠΎΡΠ½Π΅ΡΡΠΈ ΠΊ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΡΠΌ Π·Π°Π΄Π°ΡΠ°ΠΌ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π΄ΠΎΡΡΠ°ΡΠΎΡΠ½ΠΎ Π²Π΅Π»ΠΈΠΊΠΎ. ΠΠ± ΡΡΠΎΠΌ ΡΠ²ΠΈΠ΄Π΅ΡΠ΅Π»ΡΡΡΠ²ΡΡΡ, Π² ΡΠ°ΡΡΠ½ΠΎΡΡΠΈ, ΠΎΠ³ΡΠΎΠΌΠ½ΠΎΠ΅ ΡΠΈΡΠ»ΠΎ ΠΏΡΠ±Π»ΠΈΠΊΠ°ΡΠΈΠΉ Π½Π° ΡΡΡ ΡΠ΅ΠΌΡ. ΠΠ΄Π½Π°ΠΊΠΎ ΡΡΠ΅Π΄ΠΈ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° Π·Π°Π΄Π°Ρ, Π²ΡΡΡΠ΅ΡΠ°ΡΡΠΈΡ ΡΡ Π² Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΠ΅, ΠΌΠΎΠ»Π΅Π½ΠΎ Π²ΡΠ΄Π΅Π»ΠΈΡΡ ΡΠ»Π΅Π΄ΡΡΡΠΈΠ΅ ΡΠ΅ΡΡΡΠ΅ ΠΎΡΠ½ΠΎΠ²Π½ΡΡ : ΠΏΡΠΎΡΡΠ΅ΠΉΡΡΡ Π·Π°Π΄Π°ΡΡ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ, Π·Π°Π΄Π°ΡΡ ΠΎ Ρ-ΠΌΠ΅Π΄ΠΈΠ°Π½Π΅, Π·Π°Π΄Π°ΡΡ ΠΎ Ρ-ΡΠ΅Π½ΡΡΠ΅ ΠΈ ΠΊΠ²Π°Π΄ΡΠ°ΡΠΈΡΠ½ΡΡ Π·Π°Π΄Π°ΡΡ ΠΎ Π½Π°Π·Π½Π°ΡΠ΅Π½ΠΈΡΡ … Π§ΠΈΡΠ°ΡΡ Π΅ΡΡ >
- Π‘ΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅
- ΠΡΠ΄Π΅ΡΠΆΠΊΠ°
- ΠΠΈΡΠ΅ΡΠ°ΡΡΡΠ°
- ΠΡΡΠ³ΠΈΠ΅ ΡΠ°Π±ΠΎΡΡ
- ΠΠΎΠΌΠΎΡΡ Π² Π½Π°ΠΏΠΈΡΠ°Π½ΠΈΠΈ
Π‘ΠΎΠ΄Π΅ΡΠΆΠ°Π½ΠΈΠ΅
- 1. ΠΡΠΎΡΡΠ΅ΠΉΡΠ°Ρ Π·Π°Π΄Π°ΡΠ° ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ
- 1. 1. ΠΠ²ΡΡ ΡΡΠΎΡΠΎΠ½Π½Π΅Π΅ ΡΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ ΠΠΠ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ Π² ΡΠ΄Π²ΠΈΠ½ΡΡΠΎΠΉ ΡΠΎΡΠΌΠ΅ ΠΊ Π·Π°Π΄Π°ΡΠ΅ MAX SAT*
- 1. 2. ΠΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π΄Π»Ρ Π·Π°Π΄Π°ΡΠΈ MAX SAT*
- 1. 3. Π‘Π»ΠΎΠΆΠ½ΠΎΡΡΡ Π°ΠΏΠΏΡΠΎΠΊΡΠΈΠΌΠ°ΡΠΈΠΈ
- 1. 4. Π Π°Π·ΡΡΠ² Π΄Π²ΠΎΠΉΡΡΠ²Π΅Π½Π½ΠΎΡΡΠΈ
- 2. ΠΠ°Π΄Π°ΡΠ° ΠΎ Ρ-ΠΌΠ΅Π΄ΠΈΠ°Π½Π΅ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ ΠΈ Π΅Π΅ ΠΎΠ±ΠΎΠ±ΡΠ΅Π½ΠΈΡ
- 2. 1. Π‘Π²ΠΎΠΉΡΡΠ²Π° ΡΡΠ½ΠΊΡΠΈΠΈ f (S)
- 2. 2. ΠΡΠ΅Π½ΠΊΠΈ ΡΠΎΡΠ½ΠΎΡΡΠΈ ΠΆΠ°Π΄Π½ΡΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠΎΠ²
- 2. 3. ΠΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠ°Ρ Π·Π°Π΄Π°ΡΠ° ΠΎ Ρ-ΠΌΠ΅Π΄ΠΈΠ°Π½Π΅ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ
- 2. 4. ΠΠΊΠ²ΠΈΠ²Π°Π»Π΅Π½ΡΠ½Π°Ρ ΡΠΎΡΠΌΡΠ»ΠΈΡΠΎΠ²ΠΊΠ° Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ ΠΎ Ρ-ΠΌΠ΅Π΄ΠΈΠ°Π½Π΅ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ
- 2. 5. ΠΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ ΠΈ Π΅Π³ΠΎ Π°Π½Π°Π»ΠΈΠ·
- 2. 6. ΠΠ΅ΡΠ°Π½Π΄ΠΎΠΌΠΈΠ·Π°ΡΠΈΡ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°
- 3. ΠΠΎΠ²Π°Ρ ΡΠ΅Ρ
Π½ΠΈΠΊΠ° ΠΎΠΊΡΡΠ³Π»Π΅Π½ΠΈΡ Π΄Π»Ρ Π·Π°Π΄Π°Ρ Ρ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΠ΅ΠΌ ΠΌΠΎΡΠ½ΠΎΡΡΡ
- 3. 1. ΠΠ°Π΄Π°ΡΠ° ΠΎ ΠΌΠ°ΠΊΡΠΈΠΌΠ°Π»ΡΠ½ΠΎΠΌ ΠΏΠΎΠΊΡΡΡΠΈΠΈ Ρ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π°ΠΌΠΈ
- 3. 2. ΠΠ°Π΄Π°ΡΠ° ΠΎ ΠΌΠ°ΠΊΡΠΈΠΌΠ°Π»ΡΠ½ΠΎΠΌ ΡΠ°Π·ΡΠ΅Π·Π΅ Ρ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΠ΅ΠΌ Π½Π° ΠΌΠΎΡΠ½ΠΎΡΡΡ
- 3. 3. ΠΠ°Π΄Π°ΡΠ° ΠΎ ΠΌΠ°ΠΊΡΠΈΠΌΠ°Π»ΡΠ½ΠΎΠΌ ΠΊ-ΡΠ°Π·ΡΠ΅Π·Π΅ Ρ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΡΠΌΠΈ Π½Π° ΠΌΠΎΡΠ½ΠΎΡΡΡ
- 3. 4. ΠΠ°Π΄Π°ΡΠ° ΠΎ ΠΌΠ°ΠΊΡΠΈΠΌΠ°Π»ΡΠ½ΠΎΠΌ ΠΏΠΎΠΊΡΡΡΠΈΠΈ Ρ ΡΠ°Π½ΡΠ΅Π²ΡΠΌ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΠ΅ΠΌ
- 4. ΠΠ°Π΄Π°ΡΠ° Π²ΡΠΏΠΎΠ»Π½ΠΈΠΌΠΎΡΡΠΈ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ Ρ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΠ΅ΠΌ Π½Π° ΠΌΠΎΡΠ½ΠΎΡΡΡ
- 4. 1. ΠΠΈΠ½Π΅ΠΉΠ½Π°Ρ ΡΠ΅Π»Π°ΠΊΡΠ°ΡΠΈΡ ΠΈ ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ
- 4. 2. ΠΠ½Π°Π»ΠΈΠ· Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°
- 4. 2. 1. Π’Π΅Ρ Π½ΠΈΡΠ΅ΡΠΊΠΈΠ΅ Π»Π΅ΠΌΠΌΡ
- 4. 2. 2. ΠΡΠ΅Π½ΠΊΠ° ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠ³ΠΎ ΠΎΠΆΠΈΠ΄Π°Π½ΠΈΡ
- 4. 3. ΠΠ΅ΡΠ°Π½Π΄ΠΎΠΌΠΈΠ·Π°ΡΠΈΡ
- 5. ΠΠ²Π°Π΄ΡΠ°ΡΠΈΡΠ½Π°Ρ Π·Π°Π΄Π°ΡΠ° ΠΎ Π½Π°Π·Π½Π°ΡΠ΅Π½ΠΈΡΡ
- 5. 1. ΠΠ»Π³ΠΎΡΠΈΡΠΌ ΠΈ Π΅Π³ΠΎ Π°Π½Π°Π»ΠΈΠ·
- 6. ΠΠ°Π΄Π°ΡΠ° ΠΎ Ρ-ΡΠ΅Π½ΡΡΠ΅
- 6. 1. ΠΠΏΠΈΡΠ°Π½ΠΈΠ΅ ΠΈ Π°Π½Π°Π»ΠΈΠ· Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°
- 6. 2. ΠΡΠ΅Π½ΠΊΠ° ΠΎΡΠ½ΠΎΡΠΈΡΠ΅Π»ΡΠ½ΠΎΠΉ ΠΏΠΎΠ³ΡΠ΅ΡΠ½ΠΎΡΡΠΈ
Π‘ΠΏΠΈΡΠΎΠΊ Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΡ
- Π. Π. ΠΠ³Π΅Π΅Π², Π ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ Π·Π°Π΄Π°Ρ ΠΌΠΈΠ½ΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΎΠ² ΠΎΡ Π±ΡΠ»Π΅Π²ΡΡ ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ , Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 23 (1983), ΡΡΡ.3−11.
- Π. Π. ΠΠ³Π΅Π΅Π², ΠΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ ΡΠ΅ΡΠ΅Π½ΠΈΡ Π·Π°Π΄Π°ΡΠΈ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎ-ΠΏΠ°ΡΠ°Π»Π»Π΅Π»ΡΠ½ΠΎΠΉ ΡΠ΅ΡΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 30 (1990), ΡΡΡ.3−16.
- Π. Π. ΠΠ³Π΅Π΅Π², Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ ΠΌΠΈΠ½ΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ Π΄Π»Ρ Π½Π΅ΠΊΠΎΡΠΎΡΡΡ ΠΊΠ»Π°ΡΡΠΎΠ² ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΎΠ² ΠΎΡ Π±ΡΠ»Π΅Π²ΡΡ ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ , ΠΠΎΠ΄Π΅Π»ΠΈ ΠΈ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ, Π’ΡΡΠ΄Ρ ΠΠ Π‘Π Π ΠΠ 10 (1988), ΡΡΡ.5−17.
- Π. Π. ΠΠ΅Π»ΠΈΠ½ΡΠΊΠ°Ρ, ΠΠ± ΠΎΠ΄Π½ΠΎΠΌ ΠΊΠ»Π°ΡΡΠ΅ ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΎΠ² ΠΎΡ Π±ΡΠ»Π΅Π²ΡΡ ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ , Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 21 (1981), ΡΡΡ.6−12.
- Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², ΠΠ± ΠΎΠ΄Π½ΠΎΠΌ ΠΊΠ»Π°ΡΡΠ΅ Π·Π°Π΄Π°Ρ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΎΠ² ΠΎΠ΄Π½ΠΎΡΠΎΠ΄Π½ΠΎΠΉ ΡΠ΅Ρ Π½ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠΈΡΡΠ΅ΠΌΡ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 9 (1971), ΡΡΡ.65−74.
- Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², ΠΠ± ΠΎΠ΄Π½ΠΎΠΉ Π·Π°Π΄Π°ΡΠ΅ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠ΅ΠΎΡΠΈΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 11 (1973), ΡΡΡ.43−54.
- Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², ΠΠ± ΠΎΠ΄Π½ΠΎΠΉ Π·Π°Π΄Π°ΡΠ΅ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠ΅ΠΎΡΠΈΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 13 (1974), ΡΡΡ.3−9.
- Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², ΠΠ»Π³ΠΎΡΠΈΡΠΌ Π½Π΅ΡΠ²Π½ΠΎΠ³ΠΎ ΠΏΠ΅ΡΠ΅Π±ΠΎΡΠ° Π΄Π»Ρ Π·Π°Π΄Π°ΡΠΈ ΡΠΈΠΏΠ° ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ ΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 12 (1974), ΡΡΡ.24−34.
- Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ ΠΌΠΈΠ½ΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΎΠ² ΠΎΡ Π±ΡΠ»Π΅Π²ΡΡ ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ , ΠΡΠΎΠ±Π»Π΅ΠΌΡ ΠΊΠΈΠ±Π΅ΡΠ½Π΅ΡΠΈΠΊΠΈ 36 (1979), ΡΡΡ.225−246.
- Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², ΠΡΡΠ΅ΠΊΡΠΈΠ²Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π΄Π»Ρ Π·Π°Π΄Π°ΡΠΈ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΡΡΠ²Π° Ρ Π²ΠΏΠΎΠ»Π½Π΅ ΡΡΠ°Π²Π½ΠΎΠ²Π΅ΡΠ΅Π½Π½ΠΎΠΉ ΠΌΠ°ΡΡΠΈΡΠ΅ΠΉ, ΠΠΈΡΠΊΡΠ΅ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΠΈ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ 5(1) ΡΠ΅ΡΠΈΡ 1 (1998), ΡΡΡ.20−31.
- Π. Π. ΠΠ΅ΡΠ΅ΡΠ½Π΅Π², Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, Π. Π’. ΠΠ΅ΠΌΠ΅Π½ΡΡΠ΅Π², ΠΠΊΡΡΡΠ΅ΠΌΠ°Π»ΡΠ½ΡΠ΅ Π·Π°Π΄Π°ΡΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ, ΠΠ°ΡΠΊΠ°, 1978.
- Π. Π. ΠΠ΅ΡΠΊΠΎΠ²ΠΈΡ, ΠΠ°Π΄Π°ΡΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ ΠΈ Π½Π΅ΠΊΠΎΡΠΎΡΡΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΈΡ ΡΠ΅ΡΠ΅Π½ΠΈΡ, ΠΠΊΠΎΠ½ΠΎΠΌΠΈΠΊΠ° ΠΈ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ 5(2) (1969), ΡΡΡ.285−289.
- Π. Π. ΠΠ΅Π½Π΅, Π. Π. ΠΠ΅Π²Π½Π΅Ρ, ΠΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠ΅ Π°Π»Π³ΠΎΡΠΈΡΠΌΡ Π΄Π»Ρ Π½Π΅ΠΊΠΎΡΠΎΡΡΡ ΡΠ½ΠΈΠ²Π΅ΡΡΠ°Π»ΡΠ½ΡΡ Π·Π°Π΄Π°Ρ ΡΠ΅ΠΎΡΠΈΠΈ ΡΠ°ΡΠΏΠΈΡΠ°Π½ΠΈΠΉ, ΠΠ·Π²Π΅ΡΡΠΈΡ ΠΠ Π‘Π‘Π‘Π , Π’Π΅Ρ Π½ΠΈΡΠ΅ΡΠΊΠ°Ρ ΠΊΠΈΠ±Π΅ΡΠ½Π΅ΡΠΈΠΊΠ° 6 (1978), ΡΡΡ.38−43.
- Π. X. ΠΠΈΠΌΠ°Π΄ΡΡΠ΄ΠΈΠ½ΠΎΠ², Π ΡΠ²ΠΎΠΉΡΡΠ²Π°Ρ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ ΠΎΠ΄Π½ΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ ΠΎΠΏΡΠΈΠΌΠ°Π»ΡΠ½ΠΎΠ³ΠΎ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ ΡΠΎΡΠ΅ΠΊ Π½Π° ΠΎΡΡΠ΅Π·ΠΊΠ΅, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 2 (1969), ΡΡΡ.77−91.111
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, ΠΡΠ±ΠΎΡ ΠΎΠΏΡΠΈΠΌΠ°Π»ΡΠ½ΡΡ ΡΠΊΠ°Π» Π² ΠΎΠ΄Π½ΠΎΠΌ ΠΊΠ»Π°ΡΡΠ΅ Π·Π°Π΄Π°Ρ ΡΠΈΠΏΠ° ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ, ΡΠ½ΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 6 (1970), ΡΡΡ.57−70.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, ΠΡΡΠ΅ΠΊΡΠΈΠ²Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ ΡΠ΅ΡΠ΅Π½ΠΈΡ Π·Π°Π΄Π°ΡΠΈ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Ρ ΠΎΠ±Π»Π°ΡΡΡΠΌΠΈ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ ΡΠ²ΡΠ·Π½ΡΠΌΠΈ ΠΎΡΠ½ΠΎΡΠΈΡΠ΅Π»ΡΠ½ΠΎ Π°ΡΠΈΠΊΠ»ΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠ΅ΡΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 23 (1983), ΡΡΡ. 12−23.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, ΠΠ°Π΄Π°ΡΠ° ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° ΡΠ΅ΠΏΠΈ Ρ ΡΠ΅Π½ΡΡΠ°Π»ΡΠ½ΠΎ-ΡΠ²ΡΠ·Π½ΡΠΌΠΈ ΠΎΠ±Π»Π°ΡΡΡΠΌΠΈ ΠΎΠ±ΡΠ»ΡΠΆΠΈΠ²Π°Π½ΠΈΡ, Π£ΠΏΡΠ°Π²Π»ΡΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 25 (1984), ΡΡΡ. 3847.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, ΠΠ±ΠΎΡΠ½ΠΎΠ²Π°Π½ΠΈΠ΅ Π°ΠΏΡΠΈΠΎΡΠ½ΡΡ ΠΎΡΠ΅Π½ΠΎΠΊ ΠΊΠ°ΡΠ΅ΡΡΠ²Π° ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΠΎΠ³ΠΎ ΡΠ΅ΡΠ΅Π½ΠΈΡ Π·Π°Π΄Π°ΡΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 27 (1987), ΡΡΡ.3−11.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, Π Π½Π΅ΠΊΠΎΡΠΎΡΡΡ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΡ ΠΌΠΎΠ΄Π΅Π»ΡΡ ΠΈ ΠΌΠ΅ΡΠΎΠ΄Π°Ρ ΠΏΠ»Π°Π½ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΊΡΡΠΏΠ½ΠΎΠΌΠ°ΡΡΠ°Π±Π½ΡΡ ΠΏΡΠΎΠ΅ΠΊΡΠΎΠ², ΠΠΎΠ΄Π΅Π»ΠΈ ΠΈ ΠΠ΅ΡΠΎΠ΄Ρ ΠΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ, Π’ΡΡΠ΄Ρ ΠΠ Π‘Π ΠΠ Π‘Π‘Π‘Π 10 (1988), ΡΡΡ.89−115.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, ΠΠ°Π΄Π°ΡΠ° ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ Ρ Π΄Π°Π½Π½ΡΠΌΠΈ ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ»ΡΠ½ΠΎΠ³ΠΎ Π·Π½Π°ΠΊΠ° ΠΈ ΡΠ²ΡΠ·Π½ΡΠΌΠΈ, ΠΊΠ²Π°Π·ΠΈΠ²ΡΠΏΡΠΊΠ»ΡΠΌΠΈ ΠΈ ΠΏΠΎΡΡΠΈ ΠΊΠ²Π°Π·ΠΈΠ²ΡΠΏΡΠΊΠ»ΡΠΌΠΈ ΠΌΠ°ΡΡΠΈΡΠ°ΠΌΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 30 (1990), ΡΡΡ.12−23.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, ΠΡΡΠ΅ΠΊΡΠΈΠ²Π½ΡΠ΅ Π°Π»Π³ΠΎΡΠΈΡΠΌΡ Π΄Π»Ρ ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΌΠ½ΠΎΠ³ΠΎΡΡΠ°ΠΏΠ½ΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° ΡΠ΅ΠΏΠΈ, ΠΠΈΡΠΊΡΠ΅ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΠΈ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ 2(4) (1995), ΡΡΡ.13−31.112
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, Π. Π. ΠΠ»Π΅Π±ΠΎΠ², Π. Π’. ΠΠ΅ΠΌΠ΅Π½ΡΡΠ΅Π², ΠΠ± ΠΎΠ΄Π½ΠΎΠΌ ΠΌΠ΅ΡΠΎΠ΄Π΅ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Π½ΠΈΠΆΠ½Π΅ΠΉ ΠΎΡΠ΅Π½ΠΊΠΈ ΠΈ ΠΏΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΠΎΠ³ΠΎ ΡΠ΅ΡΠ΅Π½ΠΈΡ Ρ Π°ΠΏΠΎΡΡΠ΅ΡΠΈΠΎΡΠ½ΠΎΠΉ ΠΎΡΠ΅Π½ΠΊΠΎΠΉ ΡΠΎΡΠ½ΠΎΡΡΠΈ Π΄Π»Ρ Π·Π°Π΄Π°ΡΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ, Π£ΠΏΡΠ°Π²Π»ΡΠ΅ΠΌΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ 13 (1974), ΡΡΡ.26−31.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, Π. Π. ΠΠ»Π΅Π±ΠΎΠ², Π. Π. ΠΠ΅ΡΠ΅ΠΏΠ΅Π»ΠΈΡΠ°, ΠΠ»Π³ΠΎΡΠΈΡΠΌΡ Ρ ΠΎΡΠ΅Π½ΠΊΠ°ΠΌΠΈ Π΄Π»Ρ Π·Π°Π΄Π°Ρ Π΄ΠΈΡΠΊΡΠ΅ΡΠ½ΠΎΠΉ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ, ΠΡΠΎΠ±Π»Π΅ΠΌΡ ΠΊΠΈΠ±Π΅ΡΠ½Π΅ΡΠΈΠΊΠΈ 31 (1975), ΡΡΡ.35−42.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, Π. Π’. ΠΠ΅ΠΌΠ΅Π½ΡΡΠ΅Π², Π ΠΌΠ΅ΡΠΎΠ΄Π°Ρ ΡΠ΅ΡΠ΅Π½ΠΈΡ Π½Π΅ΠΊΠΎΡΠΎΡΡΡ Π·Π°Π΄Π°Ρ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΈΡ ΡΡΠ΄ΠΎΠ², Π‘ΡΠ°Π½Π΄Π°ΡΡΡ ΠΈ ΠΊΠ°ΡΠ΅ΡΡΠ²ΠΎ 12 (1971), ΡΡΡ.10−12.
- Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, Π. Π’. ΠΠ΅ΠΌΠ΅Π½ΡΡΠ΅Π², ΠΠ΅ΠΊΠΎΡΠΎΡΡΠ΅ Π·Π°Π΄Π°ΡΠΈ Π²ΡΠ±ΠΎΡΠ° ΠΎΠΏΡΠΈΠΌΠ°Π»ΡΠ½ΡΡ ΠΏΠ°ΡΠ°ΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΈΡ ΡΡΠ΄ΠΎΠ² ΠΈ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΈΡ ΡΠ΅ΡΠ΅Π½ΠΈΡ (Π·Π°Π΄Π°ΡΠΈ ΡΡΠ°Π½Π΄Π°ΡΡΠΈΠ·Π°ΡΠΈΠΈ), ΠΡΠΎΠ±Π»Π΅ΠΌΡ ΠΊΠΈΠ±Π΅ΡΠ½Π΅ΡΠΈΠΊΠΈ 27 (1973), ΡΡΡ.19−32.
- Π. Π’. ΠΠ΅ΠΌΠ΅Π½ΡΡΠ΅Π², ΠΠ°Π΄Π°ΡΠ° Π²ΡΠ±ΠΎΡΠ° ΡΠΈΠΏΠ°ΠΆΠ° ΠΎΠ±ΠΎΡΡΠ΄ΠΎΠ²Π°Π½ΠΈΡ, ΠΠ΅ΡΠΎΠ΄Ρ ΡΠΏΡΠ°Π²Π»Π΅Π½ΠΈΡ Π±ΠΎΠ»ΡΡΠΈΠΌΠΈ ΡΠΈΡΡΠ΅ΠΌΠ°ΠΌΠΈ, (1970), ΡΡΡ.60−62, ΠΡΠΊΡΡΡΠΊ: Π‘ΠΠ Π‘Π ΠΠ Π‘Π‘Π‘Π .
- Π. Π. ΠΡΠΈΡΡΡ ΠΈΠ½, ΠΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΠΎΡΡΡ Π² ΠΏΡΠΎΡΡΠ΅ΠΉΡΠ΅ΠΉ Π·Π°Π΄Π°ΡΠ΅ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ, ΠΏΡΠ΅ΠΏΡΠΈΠ½Ρ Π¦ΠΠΠ.
- Π. ΠΡΡΠΈ, Π. ΠΠΆΠΎΠ½ΡΠΎΠ½, ΠΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½ΡΠ΅ ΠΌΠ°ΡΠΈΠ½Ρ ΠΈ ΡΡΡΠ΄Π½ΠΎΡΠ΅ΡΠ°Π΅-ΠΌΡΠ΅ Π·Π°Π΄Π°ΡΠΈ, ΠΠΎΡΠΊΠ²Π°, ΠΠΈΡ, 1979.
- Π. Π. ΠΠ΅ΡΠ΅ΠΏΠ΅Π»ΠΈΡΠ°, Π. X. ΠΠΈΠΌΠ°Π΄ΠΈ, Π Π·Π°Π΄Π°ΡΠ΅ Π½Π°Ρ ΠΎΠΆΠ΄Π΅Π½ΠΈΡ ΠΌΠΈΠ½ΠΈΠΌΠ°Π»ΡΠ½ΠΎΠ³ΠΎ Π³Π°ΠΌΠΈΠ»ΡΡΠΎΠ½ΠΎΠ²Π° ΠΊΠΎΠ½ΡΡΡΠ° Π½Π° Π³ΡΠ°ΡΠ΅ ΡΠΎ Π²Π·Π²Π΅ΡΠ΅Π½Π½ΡΠΌΠΈ Π΄ΡΠ³Π°ΠΌΠΈ, ΠΠΈΡΠΊΡΠ΅ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· 15 (1969), ΡΡΡ.57−65.
- Π. Π. Π’ΡΡΠ±ΠΈΠ½, ΠΡΡΠ΅ΠΊΡΠΈΠ²Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° ΡΠ΅ΡΠΈ Π² ΡΠΎΡΠΌΠ΅ Π΄Π΅ΡΠ΅Π²Π°, ΠΠΎΠΊΠ»Π°Π΄Ρ ΠΠ Π‘Π‘Π‘Π 231(3) (1976), ΡΡΡ.547−550.
- Π. Π. Π’ΡΡΠ±ΠΈΠ½, ΠΠ²Π° ΠΊΠ»Π°ΡΡΠ° Π·Π°Π΄Π°Ρ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° Π΄ΡΠ΅Π²ΠΎΠ²ΠΈΠ΄Π½ΡΡ ΡΠ΅ΡΡΡ , ΠΠΈΠ±Π΅ΡΠ½Π΅ΡΠΈΠΊΠ° 4 (1983), ΡΡΡ.84−87.
- JI. Π. Π₯Π°ΡΠΈΡΠ½, ΠΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π² Π»ΠΈΠ½Π΅ΠΉΠ½ΠΎΠΌ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΈ-ΡΠΎΠ²Π°Π½ΠΈΠΈ, ΠΠΎΠΊΠ»Π°Π΄Ρ ΠΠ Π‘Π‘Π‘Π Ρ.244 (1979), ΡΡΡ.1093−1096.
- Π. Π. Π§Π΅ΡΠ΅Π½ΠΈΠ½, Π. Π . Π₯Π°ΡΠ°ΡΡΡΠΎΠ², Π Π΅ΡΠ΅Π½ΠΈΠ΅ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠΌ ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΡΡ ΡΠ°ΡΡΠ΅ΡΠΎΠ² ΠΎΠ΄Π½ΠΎΠ³ΠΎ ΠΊΠ»Π°ΡΡΠ° Π·Π°Π΄Π°Ρ ΠΎ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΠΈ ΠΏΡΠΎΠΈΠ·Π²ΠΎΠ΄ΡΡΠ²Π°, ΠΠΊΠΎΠ½ΠΎΠΌΠΈΠΊΠ° ΠΈ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΌΠ΅ΡΠΎΠ΄Ρ 2 (1965), ΡΡΡ.279−290.
- A. A. Ageev, A Criterion of Polynomial-Time Solvability for the Network Location Problem, Integer Programming and Combinatorial Optimization (1992), Carnegie-Mellon University, pp.237−245.
- A. A. Ageev, Complexity of the Network Median Problem on Planar Grids, Siberian Advances in Mathematics 5 (1995), pp.1−9.
- S. Ahn, C. Cooper, G. Cornuejols and A. M. Frieze, Probabilistic Analysis of a Relaxation for the /?-Median Problem, Mathematics of Operation Research 13 (1988), pp.1−31.
- N. Alon and J. N. Spencer, The Probabilistic Method, John Wiley and Sons, 1992.
- S. Arora, Probabilistic Checking of Proofs and the Hardness of Approximation Problems, PhD thesis, U.C. Berkeley, 1994.
- S. Arora, Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems, In Proceedings of the 37th IEEE FOCS (1996), pp.2−11.
- S. Arora, Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems, In Proceedings of the 38th IEEE FOCS (1997), pp.554−563.
- S. Arora, A. M. Frieze and H. Kaplan, A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems, In Proceedings of the 37th IEEE FOCS (1996),
- S. Arora, D. Karger and M. Karpinski, Polynomial Time Approximation Schemes for Dense Instances of A^P-Hard Problems, In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995), pp.21−30.
- S. Arora, M. Grigni, D. Karger, P. Klein and A. Woloszyn, Polynomial Time Approximation Scheme for Weighted Planar Graph TSP, In Proceedings of the SODA97.
- S. Arora, P. Raghavan and S. Rao, Approximation Schemes for Euclidean fc-medians and related problems, In Proceedings of the 30th STOC (1998).
- S. Arora and C. Lund, Hardness of Approximation, in the book «Approximation Algorithms for NP-hard Problems», PWS Publishing (1996).
- S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof Verification and Intractability of Approximation Problems, In Proceedings of the 33rd IEEE Symp. on Foundations of Computer Science (1992), pp.13−22.
- T. Asano, Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson, In Proceedings of the 5nd Israel Symposium on Theory and Computing Systems (1997), pp.182−189.
- Y. Bartal, Probabilistic Approximation of Metric Spaces and Its Algorithmc Applications, In Proceedings of the 37th IEE FOCS (1996), pp.184−193.
- Y. Bartal, On Approximating Arbitrary Metric by Tree Metric, In Proceedings of the 30th STOC (1998).
- B. S. Baker, Approximation algorithms for A^P-complete problems on planar graphs, Jouranl of ACM 41(1), 1994, Preliminary version in Proceedings of the 24th Annual Symposium on Foundations of Computer Science (1983), pp.265−273.
- J. Bar-Ilan, G. Kortsarz and D. Peleg, How to Allocate Network Centers, Journal of Algorithms 15 (1993), pp.385−415.
- R. Bar-Yehuda, One for the Price of Two: a Unified Approach for Approximating Covering Problems, In Proceedings of APPROX98.
- R. Bhatia, S. Guha, S. Khuller and Y. J. Sussman, Facility Location with Dynamic Distance Function, In Proceeding of 6th Scandinavian Workshop on Algorithmic Theory (SWAT) (1998).
- R. E. Burkard, E. Cela, P. M. Pardalos and L.S. Pitsoulis, Quadratic Assignment Problem, technical report of Graz University of Technology, SFB-Report 126, (1998).
- R. E. Burkard, E. Cela, V. Demidenko, N. Metelski and G. J. Woeginger, Perpespectives of Easy and Hard Cases of Quadratic Assignment Problem, technical report of Graz University of Technology, SFB-Report 104, (1997).
- R. Chandrasekaran and A. Tamir, A Polynomially Bounded Algorithms for Locating p-Centers on a Tree, Mathematical Programming 22 (1982), pp.304−315.
- M. Charikar, C. Chekuri, A. Goel and S. Guha, Rounding via Trees: Determenistic Approximation Algorithms for Group Steiner Trees and fc-Median, In Proceedings of 30th STOC.
- V. Chvatal, A Greedy Heuristic for the Set Covering Problem, Mathematics of Operation Research 4 (1979), pp.233−235.
- F. Chudak and D. Shmoys, Improved Approximation Algorithm for Uncapacitated Facility Location, unpublished manuscript.
- M. Conforti and G. Cornuejols, Submodular Set Function, Matroids and the Greedy Algorithm: Worst-Case Bounds and Some Generalizations of the Rado-Edmonds Theorem, Discrete Applied Mathematics 7 (1984), pp.251−274.
- G. Cornuejols, M. L. Fisher and G. L. Nemhauser, Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms, Management Science 22 (1977), pp.789 810.
- G. Cornuejols, G. L. Nemhauser and L. A. Wolsey The Uncapacitated Facility Location Problem, In book edited by P. B. Mirchandani and R. L. Francis, Wiley&Sons, 1990.
- G. Cornuejols, G. L. Nemhauser and L. A. Wolsey Worst Case and Probalistic Analysis of Algorithms for Location Problems, Operation Research 28 (1980), pp.847−858.
- M. E. Dyer, An 0(n) Algorithm for the Multiple Choice Knapsack Problem, Mathematical Programming 29 (1984), pp.57−63.
- M. E. Dyer and A. M. Frieze, A Simple Heuristic for the p-Center Problem, Operation Research Letters 3 (1985), pp.285−288.
- D. Erlenkotter, A Dual-Based Approach for Uncapacitated Facility Location, Operation Research 26 (1978), pp.992−1009.
- T. Feder and D. H. Green, Optimal Algorithms for Approximate Clustering, In Proceedings of 20th ACM Symp. on Theory of Computing (1988), pp.434−444.
- U. Feige, A Threshold of In n for Approximating Set Cover, Journal of ACM (to appear).
- U. Feige and M. Goemans, Approximating the Value of Two-prover Proof Systems, with Applications to MAX 2-SAT and MAX-DICUT. In Proceedings of the 3nd Israel Symposium on Theory and Computing Systems (1995), pp.182−189.
- U. Feige, S. Goldwasser, L. Lovasz, S. Safra and M. Szegedy, Approximating Clique is Almost A^P-Complete, In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (1991), pp.2−12.
- W. Feller, An Introduction to Probability Theory and Its Applications, John Wiley h Sons New York, 1968.
- M. L. Fisher, Worst-Case Analysis of Algorithms, Management Science 26 (1980), pp.1−18.
- M. L. Fisher and D. Hochbaum, Probabilistic Analysis of the Planar A'-Median Problem, Mathematics of Operation Research 5 (1980), pp. 27−34.
- M. L. Fisher, G. L. Nemhauser and L. A. Wolsey, An Analysis of Approximations for Maximizing Submodular Set Functions-II, Mathematical Programming Study 8 (1978), pp.73−88.
- A. Frieze and M. Jerrum, Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION, Algorithmica 18 (1997), pp.6781.
- A. Frieze and R. Kannan, The Regularity Lemma and Approximation Schemes for Dense Problems, In Proceedings of the 37th IEEE FOCS (1996), pp.12−30.
- M. Goemans and D. Williamson, New ¾-Approximation Algorithms for the Maximum Satisfiability Problem, SIAM Journal on Discrete Mathematics 7 (1994), pp.656−666.
- M. Goemans and D. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, Journal of ACM 42 (1995), pp.1115−1145.
- M. Goemans and D. Williamson, The Primal-dual Method for Approximation Algorithms and Its Application to Network Design Problems, in the book «Approximation algorithms for NP-hard problems», PWS Publishing, (1996).
- R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal 45 (1966), pp.1563−1581.
- M. Grigni, E. Koutsoupias and C. Papadimitron, An Approximation Scheme for Planar Graph TSP, In Proceedings of 36th FOCS (1995), pp.640−645.
- S. Guha and S. Khuller, Greedy Strikes Back: Improved Facility Location Algorithms, In Proceedings of the 9th SODA (1998).
- G. Y. Handler, p-Center Problems, in the book «Discrete Location Theory», edited by P. B. Mirchandani and R. L. Francis (1990).
- J. Hastad, Some Optimal Inapproximability Results, In Proceedings of the 28 Annual ACM Symp. on Theory of Computing (1996), pp. l-10.
- D. S. Hochbaum, Heuristics for the Fixed Cost Median Problems, Mathematical Programing 22 (1982), pp.148−162.
- D. S. Hochbaum, Approximation Algorithms for the Set Covering and Vertex Cover Problems, SIAM Journal of Computing 11 (1982), pp.555−556.
- D. S. Hochbaum, editor, Approximation Algorithms for A^P-Hard Problems, PWS Publishing (1996).
- D. S. Hochbaum, Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems, in the book «Approximation algorithms for NP-hard problems», edited by D. S. Hochbaum, PWS Publishing Company, 1996.
- D. S. Hochbaum and A. Pathria, Generalized p-Center Problems: Complexity Results and Approximation Algorithms, European Journal of Operational Research 100 (1997), pp.594−607.
- D. S. Hochbaum and A. Pathria, Locating Centers in Dynamically Changing Network and Related Problems, to appear in Location Science.
- D. S. Hochbaum and D. B. Shmoys, A Best Possible Heuristic for the Ar-center Problem, Mathematics of Operation Research 10 (1985), pp.180−184.
- D. S. Hochbaum and D. B. Shmoys, A Unified Approach to Approximation Algorithms for Bottleneck Problems, Journal of ACM, 33 (1986), pp.533−550.
- W. L. Hsu and G. L. Nemhauser, Easy and Hard Bottleneck Location Problems, Discrete Applied Mathematics 1 (1979), pp.209−216.
- D. S. Johnson, Approximation Algorithms for Combinatorial Problems, Journal Comput. System Sei. 9 (1974), pp.256−278.
- D. S. Johnson and M. S. Trick, editors, Cliques, Colorings and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26.
- O. Kariv and S. L. Hakimi, An Algorithmic Approach to Network Location Problems. II. The p-Medians., SIAM Journal of Applied Mathematics 37 (1979), pp.539−560.
- H. Karloff and U. Zwick, A 7/8-Approximation Algorithm for MAX 3SAT?, In Proceedings of the 38th FOCS (1997), pp.406−415.
- N. Karmarkar, A New Polinomial-Time Algorithm for Linear Programming, Combinatorica 4 (1984), pp.373−395.
- S. Khanna, V. Kann, J. Lagergren and A. Panconesi, On the Hardness of Approximating MAX k-CUT and Its Dual, Chicago Journal of Theoretical Computer Science 2 (1997).
- S. Khanna, R. Motwani and M. Sudan, Towards Syntactic Characterization of PTAS, In Proceedings of the 28th Annual ACM Symp. on Theory of Computing (1996), pp.329−337.
- S. Khanna, M. Sudan and D. Williamson, A Complete Classification of the Approximability of Maximization problems Derived from Boolean Constraint Satisfaction, In Proceedings of the 29th STOC, (1997), pp.11−20.
- S. Khuller, A. Moss and J. Naor, The Budgeted Maximum Coverage Problem, submitted for publication.
- S. Khuller, R. Pless and Y. J. Sussman, Fault Tolerant K-center Problems, In Proceedings of the 3rd Italian Conference on Algorithms and Complexity (1997), LNCS 1203, pp.37−48.
- S. Khuller and Y. J. Sussman, Capacitated K-center Problems, In Proceedings of 4th Annual Europeap Symposium on Algorithms (ESA) (1996), LNCS 1136, pp.152−166.
- T. Leighton and S. Rao, An Approximate Max-flow Mincut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms, In Proceedings of the 24th Annual Symposium on Foundations of Computer Science (1988), pp.422−431.
- J. H, Lin and J. S. Vitter,-Approximation with Minimum Packing Constraint Violation, In Proceedings of the 24th STOC (1992), pp.771−782.
- J. H. Lin and J. S. Vitter, Approximation Algorithms for Geometric Median Problems, Information Processing Letters 44 (1992), pp.245 249.
- L. Lovasz, On the Shannon Capacity of a Graph, IEEE Trans, of Information Theory 25(1) (1979), pp.1−7.
- C. Lund and M. Yannakakis, On the Hardness of Approximating Minimization Problems, Journal of the ACM 41 (1994), pp.960−981.
- P. B. Mirchandani, The p-Median Problem and Generalizations, in the book «Discrete Location Theory», edited by P. B. Mirchandani and R. L. Francis (1990).
- R. Motwani, J. Naor and P. Raghavan, Randomized Algorithms in Combinatorial Optimization, in the book «Approximation algorithms for NP-hard problems», PWS Publishing Company, 1996.
- R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press (1995).
- G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, 1988.
- G.L.Nemhauser and L.A.Wolsey, Best Algorithms for Approximating the Maximum of a Submodular Function, Mathematics of Operation Research 3 (1978), pp. 177−188.
- G. L. Nemhauser, L. A. Wolsey and M. L. Fisher, An Analysis of Approximations for Maximizing Submodular Set Functions-I, Mathematical Programming 14 (1978), pp.265−294.
- C. Papadimitrou, Worst-Case and Probabilistic Analysis of a Geometric Location Problem, SIAM Journal of Computing 10 (1981), pp.542−557.
- C. Papadimitrou and M. Yannakakis, Optimization, Approximation and Complexity Classes, Journal of Computer and System Sciences 43 (1991), pp.425−440.
- M. Queyranne, Performance Ratio of Polynomial Heuristics for Triangle Inequality Quadratic Assignment Problems, Operation Research Letters 4 (1986), pp. 231−234.119.
- P.Raghavan, Probabilistic Construction of Determenistic Algorithms:
- Approximating Packing Integer Programs, Journal of Computer and System Sciences 37 (1988), pp.130−143.
- P. Raghavan and C. Thompson, Randomized Rounding: a Technique for Provably Good Algorithms and Algorithmic Proofs, Combinatorica 7 (1987), pp.365−374.
- R. Raz, A Parallel Repetition Theorem, Journal of ACM (to appear).
- A. H. G. Rinnoy Kan, An Introduction to the Analysis of Aproximation Algorithms, Discrete Applied A^athematics 14 (1986), pp.171−186.
- S. Sahni, General Technique for Combinatorial Approximation, Operation Research 25 (1977), pp.920−936.
- S Sahni and T. Gonzalez, P-Complete Approximation Problems, Journal of ACM 23 (1976), pp.555−565.
- D. Shmoys, Cut Problems and Their Application to Divide-and-Conquer, in the «Approximation Algorithms for NP-hard problems», PWS Publishing (1996).
- D. Shmoys, Computing Near-Optimal Solutions to Combinatorial Optimization Problems, In W. Cook, L. Lovasz, P. Seymour, editors, Advances in Combinatorial Optimization, AMS, Providence RI (1995), pp.355−397.
- D. Shmoys, E. Tardos and K. Aardal, Approximation Algorithms for Facility Location Problems, In Proceedings of the 29 Annual ACM Symp. on Theory of Computing (1997).
- P. Slavik, A Tight Analysis of the Greedy Algorithm for Set Cover, In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996), pp.435−439.
- B. C. Tansel, R. L. Francis and T. J. Lowe, Duality: Covering and Constraining p-Center Problems on Trees, in the book «Discrete Location Theory», edited by P. B. Mirchandani and R. L. Francis (1990).
- S. Vishwanathan, An O (log*n) Approximation Algorithm for the Assymetric p-Center Problem, In Proceedings of the 7th SODA (1996). pp.1−5.
- L. A. Wolsey, An Analysis of the Greedy Algorithm for the Submodular Set Covering Problems, Mathematics of Operation Research 7 (1982), pp.417−425.
- L. A. Wolsey, Maximizing Real-valued Submodular Functions: Primal and Dual Heuristics for Location Problems, Mathematics of Operation Research 7 (1982), pp.410−425.
- M.Yannakakis, On the Approximation of Maximum Satisfiability, Journal of Algorithms 17 (1994), pp.475−502.
- Π. Π. Π‘Π²ΠΈΡΠΈΠ΄Π΅Π½ΠΊΠΎ, Π ΡΠΎΡΠ½ΠΎΡΡΠΈ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ ΠΆΠ°Π΄Π½ΡΠΌΠΈ Π°Π»Π³ΠΎΡΠΈΡΠΌΠ°ΠΌΠΈ Π·Π°Π΄Π°Ρ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ, ΠΠΈΡΠΊΡΠ΅ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΠΈ ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ 4(3) ΡΠ΅ΡΠΈΡ 1 (1997), ΡΡΡ.35−48.
- Π. Π. Π‘Π²ΠΈΡΠΈΠ΄Π΅Π½ΠΊΠΎ, ΠΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π΄Π»Ρ ΡΠ΅ΡΠ΅Π½ΠΈΡ Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΎΠΉ Π·Π°Π΄Π°ΡΠΈ ΠΎ Ρ-ΠΌΠ΅Π΄ΠΈΠ°Π½Π΅ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ, ΠΠΈΡΠΊΡΠ΅ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΠΈ ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ 4(2) ΡΠ΅ΡΠΈΡ 2 (1997), ΡΡΡ.55−62.
- Π. Π. ΠΠ³Π΅Π΅Π² ΠΈ Π. Π. Π‘Π²ΠΈΡΠΈΠ΄Π΅Π½ΠΊΠΎ, ΠΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Ρ Π°ΠΏΡΠΈΠΎΡΠ½ΠΎΠΉ ΠΎΡΠ΅Π½ΠΊΠΎΠΉ ΡΠΎΡΠ½ΠΎΡΡΠΈ Π΄Π»Ρ ΠΏΡΠΎΡΡΠ΅ΠΉΡΠ΅ΠΉ Π·Π°Π΄Π°ΡΠΈ ΡΠ°Π·ΠΌΠ΅ΡΠ΅Π½ΠΈΡ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΡΠΌ, Π’Π΅Π·ΠΈΡΡ ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΠΈΠΈ «ΠΡΠΈΠ±Π»Π΅ΠΌΡ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΈ ΡΠΊΠΎΠ½ΠΎΠΌΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΡ», ΠΠΌΡΠΊ 1997.
- Π. Π. Π‘Π²ΠΈΡΠΈΠ΄Π΅Π½ΠΊΠΎ, ΠΡΠΈΠ±Π»ΠΈΠΆΠ΅Π½Π½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π΄Π»Ρ ΡΠ΅ΡΠ΅Π½ΠΈΡ Π·Π°Π΄Π°ΡΠΈ ΠΎ Ρ-ΡΠ΅Π½ΡΡΠ΅ Ρ Π½Π΅ΡΠ°Π²Π΅Π½ΡΡΠ²ΠΎΠΌ ΡΡΠ΅ΡΠ³ΠΎΠ»ΡΠ½ΠΈΠΊΠ°, ΠΠΈΡΠΊΡΠ΅ΡΠ½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· ΠΈ ΠΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ 5(1) ΡΠ΅ΡΠΈΡ 1 (1998), ΡΡΡ.60−63.
- A. A. Ageev and Π. I. Sviridenko, An Approximation Algorithm for the Uncapacitated Facility Location Problem, Π² ΡΠ΅Π·ΠΈΡΠ°Ρ 16-Π³ΠΎ ΠΌΠ΅ΠΆΠ΄ΡΠ½Π°ΡΠΎΠ΄Π½ΠΎΠ³ΠΎ ΡΠΈΠΌΠΏΠΎΠ·ΠΈΡΠΌΠ° ΠΏΠΎ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΡΠ΅ΡΠΊΠΎΠΌΡ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠΈΡΠΎΠ²Π°Π½ΠΈΡ, ΠΠΎΠ·Π°Π½Π½Π°1997.
- A. A. Ageev and Π. I. Sviridenko, An Approximation Algorithm for the Uncapacitated Facility Location Problem, Π² ΡΠ΅Π·ΠΈΡΠ°Ρ ΡΠΈΠΌΠΏΠΎΠ·ΠΈΡΠΌΠ° ΠΏΠΎ ΠΈΡΡΠ»Π΅Π΄ΠΎΠ²Π°Π½ΠΈΡ ΠΎΠΏΠ΅ΡΠ°ΡΠΈΠΉ, ΠΠ΅Π½Π½Π° 1997.
- A.A. Ageev and Π. I. Sviridenko, An Approximation Algorithms for Some Combinatorial Problems with Cardinality Constraints, Π ΡΡΡΠ΄Π°Ρ 11-ΠΉ ΠΠ°ΠΉΠΊΠ°Π»ΡΡΠΊΠΎΠΉ ΡΠΊΠΎΠ»Ρ-ΡΠ΅ΠΌΠΈΠ½Π°ΡΠ° ΠΠ΅ΡΠΎΠ΄Ρ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ ΠΈ ΠΈΡ ΠΏΡΠΈΠ»ΠΎΠΆΠ΅Π½ΠΈΡ Ρ.1 (1998), ΡΡΡ.107−110.
- Π. I. Sviridenko, Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint, In Proceedings APPROX98, Lecture Notes in Computer Science v.1444, pp.193−199.