On-line models and algorithms for max independent set

DOI10.1051/RO:2006014zbMATH Open1110.68170OpenAlexW2082534785MaRDI QIDQ3411297FDOQ3411297

Authors: Bruno Escoffier, Vangelis Th. Paschos Edit this on Wikidata

Publication date: 11 December 2006

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2006__40_2_129_0

Recommendations

• scientific article; zbMATH DE number 1696636
• Online independent set beyond the worst-case: secretaries, prophets, and periods
• Online independent sets.
• scientific article; zbMATH DE number 1953086
• Algorithms and Computation

zbMATH Keywords

approximation algorithmscompetitive ratiomaximum independent seton-line algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Algorithms for the on-line travelling salesman
• Approximations of Weighted Independent Set and Hereditary Subset Problems
• Online independent sets.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved approximations for maximum independent set via approximation chains
• Improved approximations for weighted and unweighted graph problems

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms and Computation
• Title not available (Why is that?)
• On-line maximum-order induced hereditary subgraph problems
• Online independent sets.
• Advice complexity of maximum independent set in sparse and bipartite graphs

This page was built for publication: On-line models and algorithms for max independent set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3411297)