Search Sciweavers | Sciweavers

57 search results - page 2 / 12

» Ore-type graph packing problems

AISS
2010

161views more AISS 2010»

Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional

14 years 9 months ago

Download www.aicit.org

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

claim paper

Read More »

click to vote

ESA
2004
Springer

103views Algorithms» more ESA 2004»

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

15 years 5 months ago

Download www.cs.mcgill.ca

Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...

Michael R. Fellows, Christian Knauer, Naomi Nishim...

claim paper

Read More »

Voted

DM
2008

88views more DM 2008»

Packing triangles in low degree graphs and indifference graphs

14 years 11 months ago

Download www.ime.usp.br

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...

Gordana Manic, Yoshiko Wakabayashi

claim paper

Read More »

click to vote

SOFSEM
2009
Springer

106views Theoretical Computer Science» more SOFSEM 2009»

A Problem Kernelization for Graph Packing

15 years 6 months ago

Download theinf1.informatik.uni-jena.de

Hannes Moser

claim paper

Read More »