The following pages link to Victor Petrovich Il'ev (Q446172):
Displaying 33 items.
- (Q226472) (redirect page) (← links)
- Minimizing modular and supermodular functions on \(L\)-matroids (Q446173) (← links)
- Approximate solution of the \(p\)-median minimization problem (Q519693) (← links)
- (Q817553) (redirect page) (← links)
- Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid (Q817555) (← links)
- Hereditary systems and greedy-type algorithms. (Q1414589) (← links)
- A 2-approximation algorithm for the graph 2-clustering problem (Q2181769) (← links)
- On axiomatizability of the class of finitary matroids and decidability of their universal theory (Q2212712) (← links)
- On the problem of maximizing a modular function in the geometric lattice (Q2437631) (← links)
- Graph clustering with a constraint on cluster sizes (Q2959182) (← links)
- (Q3115248) (← links)
- Computational complexity of the graph approximation problem (Q3115581) (← links)
- (Q3115677) (← links)
- Short Survey on Graph Correlation Clustering with Minimization Criteria (Q3133198) (← links)
- Problems on independence systems solvable by the greedy algorithm (Q3225892) (← links)
- (Q3684132) (← links)
- (Q3744175) (← links)
- (Q4250860) (← links)
- (Q4268143) (← links)
- (Q4446169) (← links)
- (Q4675464) (← links)
- Approximation algorithms for graph approximation problems (Q4691776) (← links)
- (Q4742818) (← links)
- (Q4888934) (← links)
- An Approximation Algorithm for a Semi-supervised Graph Clustering Problem (Q4965096) (← links)
- $2$-Approximation algorithms for two graph clustering problems (Q5090160) (← links)
- (Q5150425) (← links)
- A CHARACTERIZATION OF MATROIDS IN TERMS OF SURFACES (Q5150743) (← links)
- On a semi-superwized graph clustering problem (Q5151244) (← links)
- APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM (Q5151277) (← links)
- ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS (Q5155648) (← links)
- An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. (Q5954088) (← links)
- Bounds for the clustering complexity in a graph clustering problem with clusters of bounded size (Q6147857) (← links)
