k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph

スポンサーリンク

概要

著者

関連論文

CONSTRUCTING CACTUS REPRESENTATION FOR ALL MINIMUM CUTS IN AN UNDIRECTED NETWORK
Constant Time Generation of Trees with Degree Bounds
6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem)
5B1 A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)
A Memory-Efficient Algorithm and Its Implementation of Variable-Size All-to-All Communication
Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Optimal augmentation of a 2-vertex-connected multigraph to a k-edge-connected and 3-vertex-connected multigraph
A Simple Proof of a Minimum Cut Algorithm and Its Applications
k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously
Enumerating Colored and Rooted Outerplanar Graphs
BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(the 50th Anniversary of the Operations Research Society of Japan)
APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(the 50th Anniversary of the Operations Research Society of Japan)
4A1 A LOCAL SEARCH ALGORITHM FOR ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW AND TRAVELING TIME CONSTRAINTS(Technical session 4A : Vehicle routing)
An Efficient Vector Transfer for Sparse Matrix-Vector Multiplication on Distributed Memory Systems
Orthogonal Drawings for Plane Graphs with Specified Face Areas
Efficient Representation of Constraints and Propagation of Variable-Value Symmetries in Distributed Constraint Reasoning
An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns
Symmetry Breaking by Dominance Detection in Distributed Environments
Around the Constructive Orbit Problem in Distributed Constraint Programming
A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
FOREWORD (Special Section on Discrete Mathematics and Its Applications)
INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(Network Design, Control and Optimization)
Accelerating A* algorithms by sweeping out small-degree nodes
Approximating the Minmax Rooted-Subtree Cover Problem(Graphs and Networks)
DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
A SUCCESSIVE OVER-RELAXATION METHOD FOR QUADRATIC PROGRAMMING PROBLEMS WITH INTERVAL CONSTRAINTS
CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS
A Simulation-Based Analysis for Worst Case Delay of Single and Multiple Interruptions
Multilingualization Based on RPC for Job-level Parallel Script Language, Xcrypt
Collision Probability in an In-Line Equipment Model under Erlang Distribution
Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS

もっと見る

スポンサーリンク