Link scheduling in polynomial time
Authors:
- B. HajekBHB. Hajek
- G. SasakiGSG. Sasaki
- 1 September 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (5) , 910-917
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Scheduling File TransfersSIAM Journal on Computing, 1985
- Optimal dynamic routing in communication networks with continuous trafficNetworks, 1984
- Some complexity results about packet radio networks (Corresp.)IEEE Transactions on Information Theory, 1984
- On Linear Characterizations of Combinatorial Optimization ProblemsSIAM Journal on Computing, 1982
- Odd Minimum Cut-Sets and b-MatchingsMathematics of Operations Research, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949