\(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-008-9191-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3004468478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean distortion and the sparsest cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-distortion embeddings of general metrics into the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-dimensional embedding with extra information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lipschitz embedding of finite metric spaces in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality gaps for sparsest cut and minimum linear arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximate Graph Partitioning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer approximation algorithms via spreading metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for minimum-weight vertex separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measured descent: A new embedding method for finite metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of graphs and some of its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:13, 2 July 2024

scientific article
Language Label Description Also known as
English
\(\ell ^2_2\) spreading metrics for vertex ordering problems
scientific article

    Statements

    \(\ell ^2_2\) spreading metrics for vertex ordering problems (English)
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite programming
    0 references
    minimum linear arrangement
    0 references
    minimum containing interval graph
    0 references
    minimum storage-time product
    0 references
    approximation algorithm
    0 references
    vertex ordering problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references