Pages that link to "Item:Q4210221"
From MaRDI portal
The following pages link to A Geometric Approach to Betweenness (Q4210221):
Displayed 21 items.
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Characterization and representation problems for intersection betweennesses (Q628325) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- A mixed integer linear programming formulation of the maximum betweenness problem (Q976481) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem (Q1659722) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Simple linear time approximation algorithm for betweenness (Q1939683) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- On subbetweennesses of trees: hardness, algorithms, and characterizations (Q2429121) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Sequence Covering Arrays and Linear Extensions (Q2946063) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$ (Q3065742) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- On Random Ordering Constraints (Q3392946) (← links)
- On Random Betweenness Constraints (Q4911112) (← links)
- (Q4993600) (← links)
- (Q6084404) (← links)