The complexity of controlled selection

DOI10.1016/0890-5401(91)90076-EzbMath0800.68496MaRDI QIDQ1173958

Udi Manber, Kirk R. Pruhs

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

complexitypolynomial-time algorithmstructural constraintscontrolled selection problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

The complexity of controlled selection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of facets (and some facets of complexity)
• Random generation of combinatorial structures from a uniform distribution
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• The ellipsoid method and its consequences in combinatorial optimization
• The complexity of controlled selection
• Forests, frames, and games: Algorithms for matroid sums and applications
• On the Problem of Decomposing a Graph into n Connected Factors
• Minimum cuts, modular functions, and matroid polyhedra
• A Constructive Procedure for Unbiased Controlled Rounding
• The Complexity of Enumeration and Reliability Problems
• The NP-Completeness of Edge-Coloring
• Selected Applications of Minimum Cuts in Networks
• Unranking and ranking spanning trees of a graph

This page was built for publication: The complexity of controlled selection