Sciweavers

94 search results - page 9 / 19
» Graph Packings
Sort
View
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
14 years 3 months ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata
IPCO
2010
184views Optimization» more  IPCO 2010»
14 years 9 days ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga
AISS
2010
161views more  AISS 2010»
13 years 8 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
14 years 4 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
SIAMDM
2010
117views more  SIAMDM 2010»
13 years 9 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...