Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Avrim L. Blum / rank
Normal rank
 
Property / author
 
Property / author: Avrim L. Blum / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with small bandwidth and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Minimization: An approximation algorithm for caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:32, 29 May 2024

scientific article
Language Label Description Also known as
English
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
scientific article

    Statements

    Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 June 2000
    0 references
    0 references
    approximation algorithms
    0 references
    semi-definite programming
    0 references
    minimum bandwidth problem
    0 references