Journal of Algorithms
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
Information Processing Letters
Path factors of bipartite graphs
Journal of Graph Theory
The hardness of approximation: gap location
Computational Complexity
An approximation algorithm for maximum packing of 3-edge paths
Information Processing Letters
Discrete Applied Mathematics
On Local Search for Weighted K-Set Packing
Mathematics of Operations Research
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the k-path partition of graphs
Theoretical Computer Science
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Journal of Combinatorial Theory Series B
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Approximation results for the weighted P4 partition problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Covering a Graph with a Constrained Forest (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On a Labeled Vehicle Routing Problem
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Complexity and approximation of the Constrained Forest problem
Theoretical Computer Science
A 3/2 approximation for a constrained forest problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Packing bipartite graphs with covers of complete bipartite graphs
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Heuristic approaches for the optimal wiring in large scale robotic skin design
Computers and Operations Research
Packing bipartite graphs with covers of complete bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems.