JOURNAL ARTICLE
Approximating max–min weighted -joins
Year: 2013 Journal: Operations Research Letters Vol: 41 (4)Pages: 321-324 Publisher: Elsevier BV
Keywords:
Combinatorics Joins Mathematics Cardinality (data modeling) Join (topology) Vertex (graph theory) Undirected graph Upper and lower bounds Enhanced Data Rates for GSM Evolution Graph Discrete mathematics Simple (philosophy) Set (abstract data type) Computer science
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
20
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Optimization and Search Problems
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Approximating min-max k-clustering
Journal: Leibniz-Zentrum für Informatik (Schloss Dagstuhl) Year: 2007
JOURNAL ARTICLE
Approximating max-min linear programs with local algorithms
Patrik FloréenPetteri KaskiTopi MustoJukka Suomela
Journal: Proceedings - IEEE International Parallel and Distributed Processing Symposium Year: 2008 Pages: 1-10
JOURNAL ARTICLE
Approximating the min–max (regret) selecting items problem
Adam KasperskiAdam KurpiszPaweł Zieliński
Journal: Information Processing Letters Year: 2012 Vol: 113 (1-2)Pages: 23-29
JOURNAL ARTICLE
Approximating the min–max (regret) selecting items problem
Kasperski, AdamKurpisz, Adam AndrzejZieliński, Paweł
Journal: BFH: ARBOR Year: 2013