English
Русский
简体中文
Kazakh
Português (Brasil)
Page Header
Computational Mathematics and Mathematical Physics
ISSN 0965-5425 (Print) ISSN 1555-6662 (Online)
Menu     Archives
  • Home
  • About the Journal
    • Editorial Team
    • Editorial Policies
    • Author Guidelines
    • About the Journal
  • Issues
    • Search
    • Current
    • Retracted articles
    • Archives
  • Contact
  • All Journals
User
Forgot password? Register
Notifications
  • View
  • Subscribe
Search
Browse
  • By Issue
  • By Author
  • By Title
  • By Sections
  • Other Journals
Subscription Login to verify subscription
Keywords Euclidean space NP-hardness Riemann problem asymptotic expansions asymptotics boundary layer boundary value problem computational fluid dynamics convergence difference scheme gradient heat equation inverse problem mathematical modeling nonlinear eigenvalue problem numerical methods numerical simulation optimal control regularization stability wave equation
×
User
Forgot password? Register
Notifications
  • View
  • Subscribe
Search
Browse
  • By Issue
  • By Author
  • By Title
  • By Sections
  • Other Journals
Subscription Login to verify subscription
Keywords Euclidean space NP-hardness Riemann problem asymptotic expansions asymptotics boundary layer boundary value problem computational fluid dynamics convergence difference scheme gradient heat equation inverse problem mathematical modeling nonlinear eigenvalue problem numerical methods numerical simulation optimal control regularization stability wave equation
Home > Search > Author Details

Author Details

Khandeev, V. I.

Issue Section Title File
Vol 56, No 2 (2016) Article Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
Vol 57, No 8 (2017) Article Approximation algorithm for the problem of partitioning a sequence into clusters
Vol 58, No 12 (2018) Article A Randomized Algorithm for a Sequence 2-Clustering Problem
Vol 59, No 5 (2019) Article Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space
Vol 59, No 9 (2019) Article Polynomial-Time Solvability of the One-Dimensional Case of an NP-Hard Clustering Problem
 

JOURNALS

Journals list

Search articles

LEGAL INFORMATION

Privacy Policy

User agreement

 

RCSI CONTATCS

phone: +7 (499) 941-01-15

address: Leninsky Prospekt 32a
Moscow, 119334

E-mail: info@rcsi.science

Technical support

E-mail: journals_support@rcsi.science 

PLATFORM POWERED BY

RUSSIAN CENTRE
FOR SCIENTIFIC INFORMATION

TOP