Approximate minimum-cost multicommodity flows in O(ε-2KNM) time

被引：0
|
作者：
Grigoriadis, Michael D. [1 ]
Khachiyan, Leonid G. [1 ]
机构：
[1] Dept. of Comp. Sci. Rutgers Univ., New Brunswick, NJ 08903, United States
来源：
Mathematical Programming, Series B | 1996年 / 75卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：477 / 482
相关论文
共 50 条
  • [21] A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
    Lingas, Andrzej
    Persson, Mia
    EURO-PAR 2012 PARALLEL PROCESSING, 2012, 7484 : 688 - 699
  • [22] A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
    Andrzej Lingas
    Mia Persson
    Algorithmica, 2015, 72 : 607 - 619
  • [23] A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
    Lingas, Andrzej
    Persson, Mia
    ALGORITHMICA, 2015, 72 (02) : 607 - 619
  • [24] Enforcing Minimum-Cost Multicast Routing against Selfish Information Flows
    Li, Zongpeng
    Williamson, Carey
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (09) : 1299 - 1308
  • [25] A PRIMAL ALGORITHM FOR FINDING MINIMUM-COST FLOWS IN CAPACITATED NETWORKS WITH APPLICATIONS
    MONMA, CL
    SEGAL, M
    BELL SYSTEM TECHNICAL JOURNAL, 1982, 61 (06): : 949 - 968
  • [26] Greedy Batch-Based Minimum-Cost Flows for Tracking Multiple Objects
    Wang, Xinchao
    Fan, Bin
    Chang, Shiyu
    Wang, Zhangyang
    Liu, Xianming
    Tao, Dacheng
    Huang, Thomas S.
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (10) : 4765 - 4776
  • [27] On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
    Bilo, Davide
    Guala, Luciano
    Proietti, Guido
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2006, 4056 : 295 - 309
  • [28] AN ALGORITHM FOR SOLVING THE MINIMUM-COST FLOW PROBLEM WITH COMPLEXITY-O(KMN(2))
    IVANCHEV, D
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1991, 44 (07): : 13 - 16
  • [29] Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
    Chen, Li
    Kyng, Rasmus
    Liu, Yang P.
    Peng, Richard
    Gutenberg, Maximilian Probst
    Sachdeva, Sushant
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 612 - 623
  • [30] A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
    van den Brand, Jan
    Chen, Li
    Peng, Richard
    Kyng, Rasmus
    Liu, Yang P.
    Gutenberg, Maximilian Probst
    Sachdeva, Sushant
    Sidford, Aaron
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 503 - 514
12345