2003/01/01 by Miroslav Chlebík, Janka Chlebíková, Janka Chlebı́ková · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Hardness of approximation #Matching (statistics) #Mathematics #NP-complete #Optimization and Search Problems #Packing problems #Statistics #Time complexity #Upper and lower bounds
paper · doi:10.1007/3-540-44849-7_21
crossref issued 2003/01/01 · crossref published 2003/01/01 · crossref published-print 2003/01/01 · openalex publication_date 2003/01/01 · crossref published-online 2003/05/13 · crossref created 2007/08/10 · crossref deposited 2019/05/01 · openalex created_date 2025/10/10 · crossref indexed 2026/03/13 · openalex updated_date 2026/07/29