On the minimum $s-t$ cut problem with budget constraints
- 23 June 2023
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 203 (1-2) , 421-442
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Multicriteria Global Minimum CutsAlgorithmica, 2006
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problemOperations Research Letters, 2004
- Self-organization and identification of Web communitiesComputer, 2002
- Trawling the Web for emerging cyber-communitiesComputer Networks, 1999
- A polyhedron with alls—t cuts as vertices, and adjacency of cutsMathematical Programming, 1995
- Simple Local Search Problems that are Hard to SolveSIAM Journal on Computing, 1991
- How easy is local search?Journal of Computer and System Sciences, 1988
- On a multicriteria shortest path problemEuropean Journal of Operational Research, 1984
- On the structure of all minimum cuts in a network and applications1980
- Properties of vertex packing and independence system polyhedraMathematical Programming, 1974