Search Results - "Chepoi, V."
-
1
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
Published in Discrete & computational geometry (2012)“…In this paper, we present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding a graph metric into a tree metric…”
Get full text
Journal Article -
2
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm
Published in Algorithmica (01-06-2012)“…Let be a centrally symmetric convex polygon of ℝ 2 and ‖ p − q ‖ be the distance between two points p , q ∈ℝ 2 in the normed plane whose unit ball is . For a…”
Get full text
Journal Article -
3
Augmenting trees to meet biconnectivity and diameter constraints
Published in Algorithmica (01-06-2002)Get full text
Journal Article -
4
Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities
Published in Journal of classification (18-08-2023)Get full text
Journal Article -
5
Graphs of Some CAT(0) Complexes
Published in Advances in applied mathematics (01-02-2000)“…In this note, we characterize the graphs (1-skeletons) of some piecewise Euclidean simplicial and cubical complexes having nonpositive curvature in the sense…”
Get full text
Journal Article -
6
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Published in Discrete Applied Mathematics (02-03-1998)“…The use of (generalized) tree structure in graphs is one of the main topics in the field of efficient graph algorithms. The well-known partial k-tree (resp…”
Get full text
Journal Article -
7
Bucolic complexes
Published in Advances in mathematics (New York. 1965) (20-08-2013)“…We introduce and investigate bucolic complexes, a common generalization of systolic complexes and CAT(0) cubical complexes. They are defined as simply…”
Get full text
Journal Article -
8
Isometric subgraphs of Hamming graphs and d-convexity
Published in Cybernetics (1988)Get full text
Journal Article -
9
Generalized Weber problem for discrete median spaces
Published in Cybernetics and systems analysis (01-01-1991)Get full text
Journal Article -
10
Centers of triangulated graphs
Published in Mathematical Notes of the Academy of Sciences of the USSR (01-01-1988)Get full text
Journal Article -
11
On Distances in Benzenoid Systems
Published in Journal of Chemical Information and Computer Sciences (21-11-1996)“…We show that the molecular graph G of a benzenoid hydrocarbon admits an isometric embedding into the Cartesian product of three trees T 1, T 2, and T 3 defined…”
Get full text
Journal Article -
12
Fuzzy clustering with structural constraints
Published in Fuzzy sets and systems (01-07-1999)“…In this paper we propose a generalization of the standard clustering problem, which we call Structural Constrained Clustering (SCC) problem. In SCC problem,…”
Get full text
Journal Article -
13
l∞-Approximation via Subdominants
Published in Journal of mathematical psychology (01-12-2000)“…Given a vector u and a certain subset K of a real vector space E, the problem of l∞-approximation involves determining an element u in K nearest to u in the…”
Get full text
Journal Article -
14
A TX-approach to some results on cuts and metrics
Published in Advances in applied mathematics (01-11-1997)Get full text
Journal Article -
15
A note on distance approximating trees in graphs
Published in Electronic notes in discrete mathematics (01-04-2000)Get full text
Journal Article -
16
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics
Published in 38th International Symposium on Multiple Valued Logic (ismvl 2008) (01-05-2008)“…Signed logic is a way of expressing the semantics of many-valued connectives and quantifiers in a formalism that is well-suited for automated reasoning. In…”
Get full text
Conference Proceeding -
17
Conditions for invariance of set diameters under d-convexification in a graph
Published in Cybernetics (1984)Get full text
Journal Article -
18
A note on distance approximating trees in graphs
Published in Electronic notes in discrete mathematics (01-05-1999)Get full text
Journal Article -
19
Distance Approximating Trees for Chordal and Dually Chordal Graphs
Published in Journal of algorithms (01-01-1999)“…In this paper we show that, for each chordal graphG, there is a treeTsuch thatTis a spanning tree of the squareG2ofGand, for every two vertices, the distance…”
Get full text
Journal Article -
20
Embedding into Rectilinear Spaces
Published in Discrete & computational geometry (01-06-1998)Get full text
Journal Article