Mengxue Liu

Mengxue Liu

Auto-generated profile, based on publicly available information

Mengxue Liu

School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2022 in Journal of Cleaner Production
Verified
Journal Article
Closed access
MLMengxue Liu
Mengxue Liu
XDXiaobin Dong
Xiaobin Dong
Xue-Chao WangXue-Chao Wang
Xue-Chao Wang
BZBingyu Zhao
Bingyu Zhao
WFWeiguo Fan
Weiguo Fan
RLRanran Liu
Ranran Liu

30 October 2014 in International Scholarly Research Notices
Verified
Journal Article
Open access
PDF file
MCMauro Margalho Coutinho
Mauro Margalho Coutinho
AEAlon Efrat
Alon Efrat
TJThienne Johnson
Thienne Johnson
ARAndrea Richa
Andrea Richa
MLMengxue Liu
Mengxue Liu
This paper investigates the feasibility of using boats as data mule nodes, carrying medical ultrasound videos from remote and isolated communities in the Amazon region in Brazil, to the main city of that area. The videos will be used by physicians to perform remote analysis and follow-up routine of prenatal examinations of pregnant women. Two open source simulators (the ONE and NS-2) were used to evaluate the results obtained utilizing a CoDPON (continuous displacement plan oriented network). The simulations took into account the connection times between the network nodes (boats) and the number of nodes on each boat route.

7 November 2023 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
ACAnya Chaturvedi
Anya Chaturvedi
CCChandra Chekuri
Chandra Chekuri
MLMengxue Liu
Mengxue Liu
ARAndréa W. Richa
Andréa W. Richa
MRMatthias Rost
Matthias Rost
JWJamison Weber
Jamison Weber
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem — the All-or-Nothing Multicommodity Flow (ANF) problem — in arbitrary directed graphs and in the practically relevant but challenging setting where demands can be (much) larger than the edge capacities, mandating the need for splittable flows (i.e., flows may not follow a single path). Formally, the input for the ANF problem is an edge-capacitated directed graph where we have a given number of source-destination node-pairs with their respective demands and strictly positive weights. The goal is to route a maximum weight subset of the given pairs (i.e., the weighted throughput), respecting the edge capacities: A commodity is routed if all of its demand is routed from its respective source to destination (this is the all-or-nothing aspect). We present a polynomial-time bi-criteria approximation randomized rounding framework for this NP-hard problem that yields an arbitrarily good approximation on the weighted throughput while violating the edge capacity constraints by at most a sublogarithmic multiplicative factor. We present two non-trivial linear programming relaxations that can be used in the framework; the first uses a novel edge-flow formulation and the second uses a packing formulation. We demonstrate the “equivalence” of these formulations and then highlight the advantages of each of the two approaches. We complement our theoretical results with a proof of concept empirical evaluation, considering a variety of network scenarios.