Huang, Chien-Chung; Sellier, François Matroid-constrained vertex cover. (English) Zbl 1522.68406 Theor. Comput. Sci. 965, Article ID 113977, 19 p. (2023). MSC: 68R10 05B35 05C22 68W25 90C27 PDFBibTeX XMLCite \textit{C.-C. Huang} and \textit{F. Sellier}, Theor. Comput. Sci. 965, Article ID 113977, 19 p. (2023; Zbl 1522.68406) Full Text: DOI arXiv
Gilbert, Hugo; Portoleau, Tom; Spanjaard, Olivier Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem. (English) Zbl 07467462 Theor. Comput. Sci. 904, 27-47 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{H. Gilbert} et al., Theor. Comput. Sci. 904, 27--47 (2022; Zbl 07467462) Full Text: DOI arXiv
Zhu, Chun Jiang; Han, Song; Lam, Kam-Yiu A fast algorithm for source-wise round-trip spanners. (English) Zbl 1517.05070 Theor. Comput. Sci. 876, 34-44 (2021). MSC: 05C22 05C20 05C85 05C70 68R10 PDFBibTeX XMLCite \textit{C. J. Zhu} et al., Theor. Comput. Sci. 876, 34--44 (2021; Zbl 1517.05070) Full Text: DOI arXiv
Björklund, Johanna; Cohen, Shay B.; Drewes, Frank; Satta, Giorgio Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. (English) Zbl 1504.68095 Theor. Comput. Sci. 870, 3-28 (2021). MSC: 68Q45 68T50 PDFBibTeX XMLCite \textit{J. Björklund} et al., Theor. Comput. Sci. 870, 3--28 (2021; Zbl 1504.68095) Full Text: DOI
Cheng, Siu-Wing; Cheong, Otfried; Lee, Taegyoung; Ren, Zhengtong Fitting a graph to one-dimensional data. (English) Zbl 1474.68214 Theor. Comput. Sci. 867, 40-49 (2021). MSC: 68R10 90C39 PDFBibTeX XMLCite \textit{S.-W. Cheng} et al., Theor. Comput. Sci. 867, 40--49 (2021; Zbl 1474.68214) Full Text: DOI arXiv
Dahn, Christine; Kriege, Nils M.; Mutzel, Petra; Schilling, Julian Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs. (English) Zbl 1477.68216 Theor. Comput. Sci. 852, 172-184 (2021). MSC: 68R10 05C85 68Q27 PDFBibTeX XMLCite \textit{C. Dahn} et al., Theor. Comput. Sci. 852, 172--184 (2021; Zbl 1477.68216) Full Text: DOI arXiv
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Nikpey, Hesam; Ono, Hirotaka Graph orientation with splits. (English) Zbl 1464.68273 Theor. Comput. Sci. 844, 16-25 (2020). MSC: 68R10 05C20 05C22 68Q25 90C27 PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 844, 16--25 (2020; Zbl 1464.68273) Full Text: DOI
Censor-Hillel, Keren; Paz, Ami; Ravid, Noam The sparsest additive spanner via multiple weighted BFS trees. (English) Zbl 1461.68146 Theor. Comput. Sci. 840, 33-44 (2020). MSC: 68R10 68W15 PDFBibTeX XMLCite \textit{K. Censor-Hillel} et al., Theor. Comput. Sci. 840, 33--44 (2020; Zbl 1461.68146) Full Text: DOI arXiv Link
Liu, Pengcheng; Zhang, Zhao; Huang, Xiaohui Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. (English) Zbl 1452.68139 Theor. Comput. Sci. 836, 59-64 (2020). MSC: 68R10 05C22 05C62 68W25 PDFBibTeX XMLCite \textit{P. Liu} et al., Theor. Comput. Sci. 836, 59--64 (2020; Zbl 1452.68139) Full Text: DOI
Cheng, Changjie; Lu, Changhong; Zhou, Yu The \(k\)-power domination problem in weighted trees. (English) Zbl 1436.05107 Theor. Comput. Sci. 809, 231-238 (2020). MSC: 05C90 05C05 05C22 05C69 05C85 90C35 PDFBibTeX XMLCite \textit{C. Cheng} et al., Theor. Comput. Sci. 809, 231--238 (2020; Zbl 1436.05107) Full Text: DOI
Bar-Noy, Amotz; Peleg, David; Rawitz, Dror Vertex-weighted realizations of graphs. (English) Zbl 1443.05038 Theor. Comput. Sci. 807, 56-72 (2020). MSC: 05C07 05C22 91D30 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Theor. Comput. Sci. 807, 56--72 (2020; Zbl 1443.05038) Full Text: DOI
Miao, Runjie; Yuan, Jinjiang; Huang, Fei Paths and trails in edge-colored weighted graphs. (English) Zbl 1436.68254 Theor. Comput. Sci. 799, 104-114 (2019). MSC: 68R10 05C22 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{R. Miao} et al., Theor. Comput. Sci. 799, 104--114 (2019; Zbl 1436.68254) Full Text: DOI
Baiocchi, Pierluigi; Calamoneri, Tiziana; Monti, Angelo; Petreschi, Rossella Some classes of graphs that are not PCGs. (English) Zbl 1433.05307 Theor. Comput. Sci. 791, 62-75 (2019). MSC: 05C99 05C22 PDFBibTeX XMLCite \textit{P. Baiocchi} et al., Theor. Comput. Sci. 791, 62--75 (2019; Zbl 1433.05307) Full Text: DOI arXiv
Jo, Changseong; Choi, Jihoon; Kim, Suh-Ryung; Sano, Yoshio On the minimum clique partitioning problem on weighted chordal graphs. (English) Zbl 1433.05140 Theor. Comput. Sci. 791, 1-9 (2019). MSC: 05C22 05C70 05C75 68W25 PDFBibTeX XMLCite \textit{C. Jo} et al., Theor. Comput. Sci. 791, 1--9 (2019; Zbl 1433.05140) Full Text: DOI
Gheibi, Amin; Maheshwari, Anil; Sack, Jörg-Rüdiger Weighted minimum backward Fréchet distance. (English) Zbl 1423.68544 Theor. Comput. Sci. 783, 9-21 (2019). MSC: 68U05 68W40 PDFBibTeX XMLCite \textit{A. Gheibi} et al., Theor. Comput. Sci. 783, 9--21 (2019; Zbl 1423.68544) Full Text: DOI
Araújo, Júlio; Sales, Cláudia Linhares; Sau, Ignasi; Silva, Ana Weighted proper orientations of trees and graphs of bounded treewidth. (English) Zbl 1421.68104 Theor. Comput. Sci. 771, 39-48 (2019). MSC: 68R10 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Araújo} et al., Theor. Comput. Sci. 771, 39--48 (2019; Zbl 1421.68104) Full Text: DOI arXiv
Lajou, Dimitri On the achromatic number of signed graphs. (English) Zbl 1405.05063 Theor. Comput. Sci. 759, 50-60 (2019). MSC: 05C15 05C22 68Q17 PDFBibTeX XMLCite \textit{D. Lajou}, Theor. Comput. Sci. 759, 50--60 (2019; Zbl 1405.05063) Full Text: DOI arXiv
Guttmann, Walter An algebraic framework for minimum spanning tree problems. (English) Zbl 1401.68246 Theor. Comput. Sci. 744, 37-55 (2018). MSC: 68R10 05C22 05C85 68T15 PDFBibTeX XMLCite \textit{W. Guttmann}, Theor. Comput. Sci. 744, 37--55 (2018; Zbl 1401.68246) Full Text: DOI
Chen, Zhi-Zhong; Harada, Youta; Guo, Fei; Wang, Lusheng Approximation algorithms for the scaffolding problem and its generalizations. (English) Zbl 1393.68186 Theor. Comput. Sci. 734, 131-141 (2018). MSC: 68W25 05C22 05C35 05C70 68W20 92D10 PDFBibTeX XMLCite \textit{Z.-Z. Chen} et al., Theor. Comput. Sci. 734, 131--141 (2018; Zbl 1393.68186) Full Text: DOI
Araújo, Júlio; Baste, Julien; Sau, Ignasi Ruling out FPT algorithms for weighted coloring on forests. (English) Zbl 1391.68045 Theor. Comput. Sci. 729, 11-19 (2018). MSC: 68Q25 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Araújo} et al., Theor. Comput. Sci. 729, 11--19 (2018; Zbl 1391.68045) Full Text: DOI arXiv
Mikos, Patryk A new lower bound for the on-line coloring of intervals with bandwidth. (English) Zbl 1382.68096 Theor. Comput. Sci. 708, 96-100 (2018). MSC: 68Q17 05C15 68R10 PDFBibTeX XMLCite \textit{P. Mikos}, Theor. Comput. Sci. 708, 96--100 (2018; Zbl 1382.68096) Full Text: DOI arXiv
Björklund, Johanna; Drewes, Frank; Jonsson, Anna Finding the \(N\) best vertices in an infinite weighted hypergraph. (English) Zbl 1371.05197 Theor. Comput. Sci. 682, 30-41 (2017). MSC: 05C65 05C22 05C25 05C85 PDFBibTeX XMLCite \textit{J. Björklund} et al., Theor. Comput. Sci. 682, 30--41 (2017; Zbl 1371.05197) Full Text: DOI
Kammer, Frank; Tholey, Torsten Approximate tree decompositions of planar graphs in linear time. (English) Zbl 1348.68296 Theor. Comput. Sci. 645, 60-90 (2016). MSC: 68W25 05C10 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{F. Kammer} and \textit{T. Tholey}, Theor. Comput. Sci. 645, 60--90 (2016; Zbl 1348.68296) Full Text: DOI
Yen, William Chung-Kung Weighted restrained domination in subclasses of planar graphs. (English) Zbl 1339.05298 Theor. Comput. Sci. 630, 13-25 (2016). MSC: 05C69 05C10 05C05 68Q17 PDFBibTeX XMLCite \textit{W. C. K. Yen}, Theor. Comput. Sci. 630, 13--25 (2016; Zbl 1339.05298) Full Text: DOI
Su, Yu-Hsuan; Lin, Ching-Chi; Lee, D. T. Broadcasting in weighted trees under the postal model. (English) Zbl 1335.68008 Theor. Comput. Sci. 621, 73-81 (2016). MSC: 68M10 05C05 05C85 68R10 PDFBibTeX XMLCite \textit{Y.-H. Su} et al., Theor. Comput. Sci. 621, 73--81 (2016; Zbl 1335.68008) Full Text: DOI
Nonner, Tim Capacitated max-batching with interval graph compatibilities. (English) Zbl 1333.05246 Theor. Comput. Sci. 613, 79-93 (2016). MSC: 05C70 05C69 05C22 05C85 68W25 68M20 68Q25 PDFBibTeX XMLCite \textit{T. Nonner}, Theor. Comput. Sci. 613, 79--93 (2016; Zbl 1333.05246) Full Text: DOI
Ting, H. F.; Xiang, Xiangzhong Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching. (English) Zbl 1332.68297 Theor. Comput. Sci. 607, Part 2, 247-256 (2015). MSC: 68W27 05C22 05C70 05C85 68W20 PDFBibTeX XMLCite \textit{H. F. Ting} and \textit{X. Xiang}, Theor. Comput. Sci. 607, Part 2, 247--256 (2015; Zbl 1332.68297) Full Text: DOI
Bonomo, Flavia; Durán, Guillermo; Valencia-Pabon, Mario Complexity of the cluster deletion problem on subclasses of chordal graphs. (English) Zbl 1330.05122 Theor. Comput. Sci. 600, 59-69 (2015). MSC: 05C70 05C22 05C69 05C85 68Q17 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Theor. Comput. Sci. 600, 59--69 (2015; Zbl 1330.05122) Full Text: DOI
Harutyunyan, Ararat; Legay, Sylvain Linear time algorithms for weighted offensive and powerful alliances in trees. (English) Zbl 1310.68164 Theor. Comput. Sci. 582, 17-26 (2015). MSC: 68R10 05C69 05C85 PDFBibTeX XMLCite \textit{A. Harutyunyan} and \textit{S. Legay}, Theor. Comput. Sci. 582, 17--26 (2015; Zbl 1310.68164) Full Text: DOI
Durocher, Stephane; Mondal, Debajyoti; Rahman, M. Saidur On graphs that are not PCGs. (English) Zbl 1306.05085 Theor. Comput. Sci. 571, 78-87 (2015). MSC: 05C22 05C12 PDFBibTeX XMLCite \textit{S. Durocher} et al., Theor. Comput. Sci. 571, 78--87 (2015; Zbl 1306.05085) Full Text: DOI
Liu, Ching-Hao; Poon, Sheung-Hung; Lin, Jin-Yong Independent dominating set problem revisited. (English) Zbl 1303.68073 Theor. Comput. Sci. 562, 1-22 (2015). MSC: 68Q25 05C69 68Q17 68W25 PDFBibTeX XMLCite \textit{C.-H. Liu} et al., Theor. Comput. Sci. 562, 1--22 (2015; Zbl 1303.68073) Full Text: DOI
Li, Meng; Otachi, Yota; Tokuyama, Takeshi Efficient algorithms for network localization using cores of underlying graphs. (English) Zbl 1360.68649 Theor. Comput. Sci. 553, 18-26 (2014). MSC: 68R10 05C62 05C69 05C85 PDFBibTeX XMLCite \textit{M. Li} et al., Theor. Comput. Sci. 553, 18--26 (2014; Zbl 1360.68649) Full Text: DOI
Chatterjee, Krishnendu; Henzinger, Monika; Krinninger, Sebastian; Loitzenbauer, Veronika; Raskin, Michael A. Approximating the minimum cycle mean. (English) Zbl 1417.68284 Theor. Comput. Sci. 547, 104-116 (2014). MSC: 68W25 05C22 05C50 05C85 68W40 90C35 PDFBibTeX XMLCite \textit{K. Chatterjee} et al., Theor. Comput. Sci. 547, 104--116 (2014; Zbl 1417.68284) Full Text: DOI arXiv
Feng, Qilong; Wang, Jianxin; Chen, Jianer Matching and weighted \(P_2\)-packing: algorithms and kernels. (English) Zbl 1279.68101 Theor. Comput. Sci. 522, 85-94 (2014). MSC: 68Q17 05C85 05C70 68W20 PDFBibTeX XMLCite \textit{Q. Feng} et al., Theor. Comput. Sci. 522, 85--94 (2014; Zbl 1279.68101) Full Text: DOI
Crowston, R.; Gutin, G.; Jones, M.; Muciaccia, G. Maximum balanced subgraph problem parameterized above lower bound. (English) Zbl 1396.68054 Theor. Comput. Sci. 513, 53-64 (2013). MSC: 68Q25 05C22 05C85 68R10 PDFBibTeX XMLCite \textit{R. Crowston} et al., Theor. Comput. Sci. 513, 53--64 (2013; Zbl 1396.68054) Full Text: DOI
Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. Increasing the minimum degree of a graph by contractions. (English) Zbl 1296.05185 Theor. Comput. Sci. 481, 74-84 (2013). MSC: 05C85 05C07 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 481, 74--84 (2013; Zbl 1296.05185) Full Text: DOI Link
Dereniowski, Dariusz Approximate search strategies for weighted trees. (English) Zbl 1253.05131 Theor. Comput. Sci. 463, 96-113 (2012). MSC: 05C85 68W25 91A43 05C22 05C05 PDFBibTeX XMLCite \textit{D. Dereniowski}, Theor. Comput. Sci. 463, 96--113 (2012; Zbl 1253.05131) Full Text: DOI
Gabow, Harold N. A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors. (English) Zbl 1251.05137 Theor. Comput. Sci. 454, 136-163 (2012). MSC: 05C70 05C22 68R05 68R10 PDFBibTeX XMLCite \textit{H. N. Gabow}, Theor. Comput. Sci. 454, 136--163 (2012; Zbl 1251.05137) Full Text: DOI
Czyzowicz, Jurek; Gąsieniec, Leszek; Pelc, Andrzej Choosing the best among peers. (English) Zbl 1246.05154 Theor. Comput. Sci. 440-441, 52-59 (2012). MSC: 05C90 05C20 91B12 68U99 PDFBibTeX XMLCite \textit{J. Czyzowicz} et al., Theor. Comput. Sci. 440--441, 52--59 (2012; Zbl 1246.05154) Full Text: DOI
Elbassioni, Khaled; Jelić, Slobodan; Matijević, Domagoj The relation of connected set cover and group Steiner tree. (English) Zbl 1246.05148 Theor. Comput. Sci. 438, 96-101 (2012). MSC: 05C85 05C70 05C05 PDFBibTeX XMLCite \textit{K. Elbassioni} et al., Theor. Comput. Sci. 438, 96--101 (2012; Zbl 1246.05148) Full Text: DOI
Bezáková, Ivona; Friedlander, Adam J. Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time. (English) Zbl 1236.05066 Theor. Comput. Sci. 417, 2-11 (2012). MSC: 05C10 05C22 05C85 68U10 68R10 PDFBibTeX XMLCite \textit{I. Bezáková} and \textit{A. J. Friedlander}, Theor. Comput. Sci. 417, 2--11 (2012; Zbl 1236.05066) Full Text: DOI
Yang, Chaoxia; Li, Guojun A polynomial time approximation scheme for embedding hypergraph in a weighted cycle. (English) Zbl 1228.68034 Theor. Comput. Sci. 412, No. 48, 6786-6793 (2011). MSC: 68Q17 05C85 05C65 PDFBibTeX XMLCite \textit{C. Yang} and \textit{G. Li}, Theor. Comput. Sci. 412, No. 48, 6786--6793 (2011; Zbl 1228.68034) Full Text: DOI
Turau, Volker; Hauck, Bernd A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2. (English) Zbl 1263.68175 Theor. Comput. Sci. 412, No. 40, 5527-5540 (2011). MSC: 68W25 68M14 68R10 05C70 PDFBibTeX XMLCite \textit{V. Turau} and \textit{B. Hauck}, Theor. Comput. Sci. 412, No. 40, 5527--5540 (2011; Zbl 1263.68175) Full Text: DOI
Bshouty, Nader H.; Mazzawi, Hanna Reconstructing weighted graphs with minimal query complexity. (English) Zbl 1209.68267 Theor. Comput. Sci. 412, No. 19, 1782-1790 (2011). MSC: 68Q17 05C22 05C60 92D20 PDFBibTeX XMLCite \textit{N. H. Bshouty} and \textit{H. Mazzawi}, Theor. Comput. Sci. 412, No. 19, 1782--1790 (2011; Zbl 1209.68267) Full Text: DOI
Nutov, Zeev Approximating directed weighted-degree constrained networks. (English) Zbl 1211.68018 Theor. Comput. Sci. 412, No. 8-10, 901-912 (2011). MSC: 68M10 68R10 90C35 PDFBibTeX XMLCite \textit{Z. Nutov}, Theor. Comput. Sci. 412, No. 8--10, 901--912 (2011; Zbl 1211.68018) Full Text: DOI
Zou, Feng; Wang, Yuexuan; Xu, Xiao-Hua; Li, Xianyue; Du, Hongwei; Wan, Pengjun; Wu, Weili New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. (English) Zbl 1209.68389 Theor. Comput. Sci. 412, No. 3, 198-208 (2011). MSC: 68R10 05C69 68W25 PDFBibTeX XMLCite \textit{F. Zou} et al., Theor. Comput. Sci. 412, No. 3, 198--208 (2011; Zbl 1209.68389) Full Text: DOI
Sankowski, Piotr Maximum weight bipartite matching in matrix multiplication time. (English) Zbl 1228.05238 Theor. Comput. Sci. 410, No. 44, 4480-4488 (2009). MSC: 05C70 05C85 68R10 68W20 PDFBibTeX XMLCite \textit{P. Sankowski}, Theor. Comput. Sci. 410, No. 44, 4480--4488 (2009; Zbl 1228.05238) Full Text: DOI
Alhazov, Artiom; Petre, Ion; Rogojin, Vladimir The parallel complexity of signed graphs: Decidability results and an improved algorithm. (English) Zbl 1167.68022 Theor. Comput. Sci. 410, No. 24-25, 2308-2315 (2009). MSC: 68Q25 05C22 05C85 68W10 92C37 92D10 PDFBibTeX XMLCite \textit{A. Alhazov} et al., Theor. Comput. Sci. 410, No. 24--25, 2308--2315 (2009; Zbl 1167.68022) Full Text: DOI
Dai, Decheng; Yu, Changyuan A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph. (English) Zbl 1162.68042 Theor. Comput. Sci. 410, No. 8-10, 756-765 (2009). MSC: 68W25 05C69 68R10 PDFBibTeX XMLCite \textit{D. Dai} and \textit{C. Yu}, Theor. Comput. Sci. 410, No. 8--10, 756--765 (2009; Zbl 1162.68042) Full Text: DOI
Lee, Jonathan K.; Palsberg, Jens; Pereira, Fernando Magno Quintão Aliased register allocation for straight-line programs is NP-complete. (English) Zbl 1160.68015 Theor. Comput. Sci. 407, No. 1-3, 258-273 (2008). MSC: 68Q17 68R10 PDFBibTeX XMLCite \textit{J. K. Lee} et al., Theor. Comput. Sci. 407, No. 1--3, 258--273 (2008; Zbl 1160.68015) Full Text: DOI
Michail, Dimitrios Reducing rank-maximal to maximum weight matching. (English) Zbl 1143.05068 Theor. Comput. Sci. 389, No. 1-2, 125-132 (2007). MSC: 05C70 05C85 90C27 PDFBibTeX XMLCite \textit{D. Michail}, Theor. Comput. Sci. 389, No. 1--2, 125--132 (2007; Zbl 1143.05068) Full Text: DOI
Chen, Mingxia; Li, Jianbo; Li, Jianping; Li, Weidong; Wang, Lusheng Some approximation algorithms for the clique partition problem in weighted interval graphs. (English) Zbl 1144.68045 Theor. Comput. Sci. 381, No. 1-3, 124-133 (2007). MSC: 68R10 05C62 05C70 05C85 68Q17 68W25 90C27 90C35 PDFBibTeX XMLCite \textit{M. Chen} et al., Theor. Comput. Sci. 381, No. 1--3, 124--133 (2007; Zbl 1144.68045) Full Text: DOI
Devienne, Philippe; Lebègue, Patrick; Dauchet, Max Weighted systems of equations. (English) Zbl 0783.68116 Theor. Comput. Sci. 119, No. 1, 39-62 (1993). MSC: 68T99 68N17 68Q55 PDFBibTeX XMLCite \textit{P. Devienne} et al., Theor. Comput. Sci. 119, No. 1, 39--62 (1993; Zbl 0783.68116) Full Text: DOI
Hoàng, Chính T. A parallel algorithm for minimum weighted colouring of triangulated graphs. (English) Zbl 0761.68073 Theor. Comput. Sci. 99, No. 2, 335-344 (1992). MSC: 68R10 68W15 68Q25 PDFBibTeX XMLCite \textit{C. T. Hoàng}, Theor. Comput. Sci. 99, No. 2, 335--344 (1992; Zbl 0761.68073) Full Text: DOI
Monien, B.; Sudborough, I. H. Min Cut is NP-complete for edge weighted trees. (English) Zbl 0657.68034 Theor. Comput. Sci. 58, No. 1-3, 209-229 (1988). Reviewer: A.Brandstädt MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Monien} and \textit{I. H. Sudborough}, Theor. Comput. Sci. 58, No. 1--3, 209--229 (1988; Zbl 0657.68034) Full Text: DOI
Venkatesan, Shankar M. Approximation algorithms for weighted matching. (English) Zbl 0643.68084 Theor. Comput. Sci. 54, 129-137 (1987). MSC: 68R10 05C70 68Q25 PDFBibTeX XMLCite \textit{S. M. Venkatesan}, Theor. Comput. Sci. 54, 129--137 (1987; Zbl 0643.68084) Full Text: DOI
Frederickson, Greg N.; Ja’ja’, Joseph On the relationship between the biconnectivity augmentation and traveling salesman problems. (English) Zbl 0486.90082 Theor. Comput. Sci. 19, 189-201 (1982). MSC: 90C35 05C35 65K05 PDFBibTeX XMLCite \textit{G. N. Frederickson} and \textit{J. Ja'ja'}, Theor. Comput. Sci. 19, 189--201 (1982; Zbl 0486.90082) Full Text: DOI