On-line vertex-covering (Q1770381): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2004.08.015 / rank
Normal rank
 
Property / author
 
Property / author: Marc Demange / rank
Normal rank
 
Property / author
 
Property / author: Marc Demange / rank
 
Normal rank
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.1016/j.tcs.2004.08.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076855469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line travelling salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online independent sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2004.08.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:04, 11 December 2024

scientific article
Language Label Description Also known as
English
On-line vertex-covering
scientific article

    Statements

    On-line vertex-covering (English)
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    On-line algorithm
    0 references
    Competitive ratio
    0 references
    Approximation
    0 references
    Graph
    0 references
    Vertex-covering
    0 references

    Identifiers