Article

Free access

The network inhibition problem

Author:

Cynthia A. PhillipsAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 776 - 785

https://doi.org/10.1145/167088.167286

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

A. Aggarwal and M. M. Klawe, "Applications of generalized matrix searching to geometric algorithms", Dzscrete Applied Mathematics, 27(1,2):3- 23, May, 1990.

Digital Library

Google Scholar

[2]

A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber, "Geometric applications of a matrixsearching algorithm", Algorithmica, 2(2):195-208, 1987.

Digital Library

Google Scholar

[3]

A. Aggarwal and J. K. Park, "Improved Algorithms for Economic Lot-Size Problems", Oper. Res., to appear, (Report RC 15626, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1990).

Digital Library

Google Scholar

[4]

M. O. Ball and j. S. Provan, "Calculating bounds on teachability and connectedness in stochastic networks", Networks, 13:253-278, 1983.

Crossref

Google Scholar

[5]

D. Bienstock, "Some generalized max-flow rain-cut problems in the plane," Mathematics of Operations Research, 16(2):310-333, May 1991.

Digital Library

Google Scholar

[6]

P. Z. Chinn, :I. Chv~talov~, A. K. Dewdney, N.E. Gibbs, "The bandwidth problem for graphs and matrices a survey", J. Graph Theory, Vol. 6, 1982, pp. 223-254.

Crossref

Google Scholar

[7]

J. Chv~talov~, A. K. Dewdney, N. E. Gibbs, R. R. Korfhage, "The bandwidth problem for graphs: a collection of recent results", Res. report #24, Dept. of Comput. Sci., UWO, London, Ont, 1975.

Google Scholar

[8]

:I. Cheriyan, T. Hagerup, and K. Mehlhorn, "Can a maximum flow be computed in o(mn) time?", Proceedings of ICALP, 1990.

Digital Library

Google Scholar

[9]

W. Cunningham, "Optimal attack and reinforcement of a network", JACM, 32(3):549-561, July 1985.

Digital Library

Google Scholar

[10]

L. R. Ford Jr. and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, Nil, 1962.

Crossref

Google Scholar

[11]

G. Fredrickson, "Fast algorithms for shortest paths in planar graphs, with applications", SIAM J. Comput., 16(6):1004-1022, Dec. 1987.

Digital Library

Google Scholar

[12]

G. Fredrickson, "Planar graph decomposition and all pairs shortest paths", JACM, 38(1):162-204, 1991.

Digital Library

Google Scholar

[13]

G. Oallo, M. D. Grigoriadis, and R. E. Tarjan, "A fast parametric maximum flow algorithm and applications," SIAM J. Comput. 18(1):30-55, Feb. 1989.

Digital Library

Google Scholar

[14]

M. R. Garey, D. S. Johnson, and L. Stockmeyer, "Some simplified NP-complete graph problems", Theoretical Computer Science, 1:237-267, 1976.

Google Scholar

[15]

M. 1%. Garey, and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, W. H. Freeman and Company, NY, 1979.

Digital Library

Google Scholar

[16]

A. Goldberg, R. Tarjan, "A new approach to the maximumflow problem", JA CM, 35:921-940, 1988.

Digital Library

Google Scholar

[17]

O. Goldschmidt and D. Hochbaum, "Polynomial algorithm for the k-cut problem", Proc. 29th FOCS, 1988, pp. 444-451.

Digital Library

Google Scholar

[18]

D. Gusfield, "Computing the strength of a graph," SIAM J. Comput., 20(4):639-654, Aug. 1991.

Digital Library

Google Scholar

[19]

F. Hadlock, "Finding a maximum cut of a planar graph in polynomial time", SIAM J. Comput., 4(3):221-225, Sept. 1975.

Digital Library

Google Scholar

[20]

P. L. Hammer, R. Maffray, and M. Queyranne, "Cut-threshold graphs", Dzscrete Applied Ma~hematzcs, 30:163-179, 1991.

Digital Library

Google Scholar

[21]

F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.

Google Scholar

[22]

R. Hassin, "Approximation schemes for the restricted shortest path problem", Malh. Oper. Res., 17(1):36-42, Feb. 1992.

Digital Library

Google Scholar

[23]

R. Hassin and D. Johnson, "An O(nlog2 n) algorithm for maximum flow in undirected planar networks", SIAM J. Comput., 14(3):612-624, Aug. 1985.

Digital Library

Google Scholar

[24]

A. Itai and Y. Shiloach, "Maximum flow in planar networks", SIAM J. Compute., 8(2):135-150, 1979.

Digital Library

Google Scholar

[25]

D. Johnson, "The NP-completeness column: an ongoing guide (16th)", J. Alg., 6(3):434-451, 1985.

Crossref

Google Scholar

[26]

H. C. :Ioksch, "The shortest route problem with Constraints", J. Math. Anal. Appl., 14:191-197, 1966.

Crossref

Google Scholar

[27]

R. Karp, "Reducibility among combinatorial problems", in Complexzty of Computer Computaiions, R. E. Miller and J. W. Thatcher eds., Plenum Press, NY, 1972, pp. 85-103.

Google Scholar

[28]

V. King, S. Rao, and R. Tarjan, "A faster deterministic maximum flow algorithm", Proc. 3rd ACM- SIAM SODA, 1992, pp. 157-164.

Digital Library

Google Scholar

[29]

M. M. Klawe and D. J. Kleitman, "An almost linear time algorithm for generalized matrix searching" SIAM J. Disc. Math., 3(1):81-97, Feb. 1990.

Digital Library

Google Scholar

[30]

P.N. Klein, A. Agrawal, R. Ravi, and S. Rao, "Approximation through multicommodity flow," Proc. 31s# Annual FOCS, 1990, pp. 726-737.

Google Scholar

[31]

E. L. Lawler, Combinatorial Optimizalzon: Networks and Matroids, Holt, Rinehart, and Winston, New York, 1976.

Google Scholar

[32]

E. Minieka, "Maximal, lexicographic, and dynamic network flows", Oper. _Res., 21(2):517-527, 1973.

Digital Library

Google Scholar

[33]

J. K. Park and C. A. Phillips, manuscript in preparation.

Google Scholar

[34]

C. H. Papadimitriou and K. Steiglitz, Combzna- ~omal Optim,zation: Algomthms and Complezzty, Prentice-Hall, Inc, Englewood Cliffs, Nil, 1982.

Digital Library

Google Scholar

[35]

C. A. Phillips, manuscript in preparation.

Google Scholar

[36]

F. Preparata and M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, NY, 1985.

Digital Library

Google Scholar

[37]

J. S. Provan and M. O. Ball, "The complexity of counting cuts and of computing the probability that a graph is connected", SIAM J. Compul., 12(4):777-788, Nov. 1983.

Digital Library

Google Scholar

[38]

J. Reif, "Minimum s-t cut of a planar undirected network in O(nlog2(n)) time", SIAM J. Comput., 12(1):71-81, Feb. 1983.

Digital Library

Google Scholar

[39]

I#va Tardos, priviate communication.

Google Scholar

[40]

S. Tsukiyama, I. Shirakawa, and H. Ozaki, "An algorithm to enumerate all cutsets of a graph in linear time per cutset", JA CM, 27(4):619-632, Oct. 1980.

Digital Library

Google Scholar

Cited By

View all

Boeckmann JThielen C(2024) A -approximation for network flow interdiction with unit costs Discrete Applied Mathematics10.1016/j.dam.2021.07.008354(58-71)Online publication date: Sep-2024
https://doi.org/10.1016/j.dam.2021.07.008
Paul AMartonosi S(2024)The all-pairs vitality-maximization (VIMAX) problemAnnals of Operations Research10.1007/s10479-024-06022-4338:2-3(1019-1048)Online publication date: 10-May-2024
https://doi.org/10.1007/s10479-024-06022-4
Balzotti LFranciosa P(2024)How vulnerable is an undirected planar graph with respect to max flowNetworks10.1002/net.2220583:3(570-586)Online publication date: 3-Jan-2024
https://doi.org/10.1002/net.22205
Show More Cited By

Index Terms

The network inhibition problem
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Network flows
      2. Paths and connectivity problems
2. Theory of computation

Recommendations

Tonically balancing intracortical excitation and inhibition by gabaergic gliotransmission

For sensory cortices to respond reliably to feature stimuli, the balancing of neuronal excitation and inhibition is crucial. A typical example might be the balancing of phasic excitation within cell assemblies and phasic inhibition between cell ...
GABA inhibition modulates NMDA-R mediated spike timing dependent plasticity (STDP) in a biophysical model

Spike timing dependent plasticity (STDP) has been demonstrated in various neural systems of many animals. It has been shown that STDP depends on the target and the location of the synapse and is dynamically regulated by the activity of adjacent synapses,...
Modulation of spike and burst rate in a minimal neuronal circuit with feed-forward inhibition

Pyramidal cells perform computations on their inputs within the context of the local network. The present computational study investigates the consequences of feed-forward inhibition for the firing rate and reliability of a typical hippocampal pyramidal ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

146
Total Citations
View Citations
1,954
Total Downloads

Downloads (Last 12 months)242
Downloads (Last 6 weeks)36

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Boeckmann JThielen C(2024) A -approximation for network flow interdiction with unit costs Discrete Applied Mathematics10.1016/j.dam.2021.07.008354(58-71)Online publication date: Sep-2024
https://doi.org/10.1016/j.dam.2021.07.008
Paul AMartonosi S(2024)The all-pairs vitality-maximization (VIMAX) problemAnnals of Operations Research10.1007/s10479-024-06022-4338:2-3(1019-1048)Online publication date: 10-May-2024
https://doi.org/10.1007/s10479-024-06022-4
Balzotti LFranciosa P(2024)How vulnerable is an undirected planar graph with respect to max flowNetworks10.1002/net.2220583:3(570-586)Online publication date: 3-Jan-2024
https://doi.org/10.1002/net.22205
Bavandi SBigdeli H(2023)A maximum flow network interdiction model in fuzzy stochastic hybrid uncertainty environmentsYugoslav Journal of Operations ResearchYUJOR10.2298/YJOR220415038B33:3(409-424)Online publication date: 2023
https://doi.org/10.2298/YJOR220415038B
Huang YLin YHe T(2023)Optimized Cross-Path Attacks via Adversarial ReconnaissanceProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/36267897:3(1-30)Online publication date: 7-Dec-2023
https://dl.acm.org/doi/10.1145/3626789
Zhang WJiang ZYao Q(2023)DND: Deep Learning-Based Directed Network DisintegratorIEEE Journal on Emerging and Selected Topics in Circuits and Systems10.1109/JETCAS.2023.329031913:3(841-850)Online publication date: Sep-2023
https://doi.org/10.1109/JETCAS.2023.3290319
Pan PLichen JWang WCai LLi J(2023)Approximation Algorithms for Solving the k-Chinese Postman Problem Under Interdiction Budget ConstraintsJournal of the Operations Research Society of China10.1007/s40305-023-00488-yOnline publication date: 29-May-2023
https://doi.org/10.1007/s40305-023-00488-y
Balzotti LFranciosa P(2023)How Vulnerable is an Undirected Planar Graph with Respect to Max FlowAlgorithms and Complexity10.1007/978-3-031-30448-4_7(82-96)Online publication date: 25-Apr-2023
https://doi.org/10.1007/978-3-031-30448-4_7
Huang XZhu XXu XZhang QLiang A(2022)Parallel Learning of Dynamics in Complex SystemsSystems10.3390/systems1006025910:6(259)Online publication date: 15-Dec-2022
https://doi.org/10.3390/systems10060259
Aissi HChen DRavi R(2022)Vertex downgrading to minimize connectivityMathematical Programming10.1007/s10107-022-01824-5199:1-2(215-249)Online publication date: 3-Jun-2022
https://doi.org/10.1007/s10107-022-01824-5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Tonically balancing intracortical excitation and inhibition by gabaergic gliotransmission

GABA inhibition modulates NMDA-R mediated spike timing dependent plasticity (STDP) in a biophysical model

Modulation of spike and burst rate in a minimal neuronal circuit with feed-forward inhibition