Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2006.02.008 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002060450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling to meet two min-sum objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria approximation algorithms for scheduling problems with communications delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality constrained minimum cut problems: complexity and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization / 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: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2006.02.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:37, 19 December 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
scientific article

    Statements

    Identifiers