@article{Van_Huy_Pham_70119977,
	title = {A combinatorial algorithm for the ordered 1-median problem on cactus graphs},
	volume = {56},
	issn = {09750320},
	url = {http://doi.org/10.1007/s12597-019-00402-2},
	doi = {10.1007/s12597-019-00402-2},
	abstract = {Cactus graph is a graph in which any two simple cycles has at most one vertex in common. In this paper we address the ordered 1-median location problem on cactus graphs, a generalization of some popular location models such as 1-median, 1-center, and 1-centdian problems. For the case with non-decreasing multipliers, we show that there exists a cycle or an edge that contains an ordered 1-median. Based on this property, we develop a combinatorial algorithm that finds an ordered 1-median on a cactus in O(n2log n) time, where n is the number of vertices in the underlying cactus.},
	number = {3},
	journal = {Opsearch},
	author = {Pham, Van Huy and Tam, Nguyen Chi},
	year = {2019},
	keywords = {Cactus, Convex, Location problem, Ordered 1-median},
	pages = {780--789},
}

{"_id":"Nfp3jEDv2cCK95MCr","bibbaseid":"pham-tam-acombinatorialalgorithmfortheordered1medianproblemoncactusgraphs-2019","author_short":["Pham, V. H.","Tam, N. C."],"bibdata":{"bibtype":"article","type":"article","title":"A combinatorial algorithm for the ordered 1-median problem on cactus graphs","volume":"56","issn":"09750320","url":"http://doi.org/10.1007/s12597-019-00402-2","doi":"10.1007/s12597-019-00402-2","abstract":"Cactus graph is a graph in which any two simple cycles has at most one vertex in common. In this paper we address the ordered 1-median location problem on cactus graphs, a generalization of some popular location models such as 1-median, 1-center, and 1-centdian problems. For the case with non-decreasing multipliers, we show that there exists a cycle or an edge that contains an ordered 1-median. Based on this property, we develop a combinatorial algorithm that finds an ordered 1-median on a cactus in O(n2log n) time, where n is the number of vertices in the underlying cactus.","number":"3","journal":"Opsearch","author":[{"propositions":[],"lastnames":["Pham"],"firstnames":["Van","Huy"],"suffixes":[]},{"propositions":[],"lastnames":["Tam"],"firstnames":["Nguyen","Chi"],"suffixes":[]}],"year":"2019","keywords":"Cactus, Convex, Location problem, Ordered 1-median","pages":"780–789","bibtex":"@article{Van_Huy_Pham_70119977,\n\ttitle = {A combinatorial algorithm for the ordered 1-median problem on cactus graphs},\n\tvolume = {56},\n\tissn = {09750320},\n\turl = {http://doi.org/10.1007/s12597-019-00402-2},\n\tdoi = {10.1007/s12597-019-00402-2},\n\tabstract = {Cactus graph is a graph in which any two simple cycles has at most one vertex in common. In this paper we address the ordered 1-median location problem on cactus graphs, a generalization of some popular location models such as 1-median, 1-center, and 1-centdian problems. For the case with non-decreasing multipliers, we show that there exists a cycle or an edge that contains an ordered 1-median. Based on this property, we develop a combinatorial algorithm that finds an ordered 1-median on a cactus in O(n2log n) time, where n is the number of vertices in the underlying cactus.},\n\tnumber = {3},\n\tjournal = {Opsearch},\n\tauthor = {Pham, Van Huy and Tam, Nguyen Chi},\n\tyear = {2019},\n\tkeywords = {Cactus, Convex, Location problem, Ordered 1-median},\n\tpages = {780--789},\n}\n\n","author_short":["Pham, V. H.","Tam, N. C."],"key":"Van_Huy_Pham_70119977","id":"Van_Huy_Pham_70119977","bibbaseid":"pham-tam-acombinatorialalgorithmfortheordered1medianproblemoncactusgraphs-2019","role":"author","urls":{"Paper":"http://doi.org/10.1007/s12597-019-00402-2"},"keyword":["Cactus","Convex","Location problem","Ordered 1-median"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://api.zotero.org/groups/2168152/items?key=VCdsaROd5deDY3prqqG8kI0c&format=bibtex&limit=100","dataSources":["syJjwTDDM32TsM2iF","QwrFbRJvXF69SEShv","HbngRCZLbLed2q9QT","LtEFvT85hYpNg4Esp","iHfnnAr7wKJJxkNMt","PrvBTxn4Zgeep29e5","78Yd9ZHcx783Wkffe","SKRhTA7ok4L4waPkZ","GfrMfnKTkYdcYTRsy","RqqCdXGEyWH4dZ76k","cbiwaQPQJSZeJDDY9","2Jak7xK39ytqcgqQ4","CDfDBPD6CDScj6Ty4","WgiCycoQjRx6KArBy","KBdipwowTNXWiKqYd","yjd6eECyb3TYZpZ3R","D9jmZ7aoHfJnYQ4ES","R8dLFAvyQ2oFRijDJ","dc6SzEK4S9LfC3XpA","kGWABmrDfhF29uibh","YE9GesxGLCsBc3vvC","v3qfuosZ66nvD85FK","BSxBG5ms26R2teZn9"],"keywords":["cactus","convex","location problem","ordered 1-median"],"search_terms":["combinatorial","algorithm","ordered","median","problem","cactus","graphs","pham","tam"],"title":"A combinatorial algorithm for the ordered 1-median problem on cactus graphs","year":2019}