Combinatorics of TCP reordering

DOI10.1007/S10878-006-8904-0zbMath1132.90365OpenAlexW2080577122MaRDI QIDQ857780

N. E. Zubov

Publication date: 5 January 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-8904-0

zbMATH Keywords

combinatorial problemtraffic

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (1)

Counting preimages of TCP reordering patterns

Cites Work

• Counting preimages of TCP reordering patterns
• Random generation of combinatorial structures from a uniform distribution
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Accelerating simulated annealing for the permanent and combinatorial counting problems
• Graph minors. II. Algorithmic aspects of tree-width
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

This page was built for publication: Combinatorics of TCP reordering