Integer Programming and Combinatorial Optimization

DOI10.1007/B97946MaRDI QIDQ5712450zbMATH OpenOpenAlexFDO

Authors Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid G. Khachiyan

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On enumerating minimal dicuts and strongly connected subgraphs
• Mathematical Foundations of Computer Science 2004
• Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
• Algorithms and Computation
• On enumerating all minimal solutions of feedback problems

Cited in

(12)

• Listing minimal edge-covers of intersecting families with applications to connectivity problems
• On enumerating minimal dicuts and strongly connected subgraphs
• Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
• Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs
• Mathematical Foundations of Computer Science 2004
• Generating all vertices of a polyhedron is hard
• Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
• A linear delay algorithm in SD set system and its application to subgraph enumeration
• An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
• Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
• Scientific contributions of Leo Khachiyan (a short overview)
• Generating 3-vertex connected spanning subgraphs

Describes a project that uses

Uses Software

• MCFClass

This page was built for publication: Integer Programming and Combinatorial Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712450)