Minmax subtree cover problem on cacti

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 154; no. 8; pp. 1254 - 1263
Main Authors: Nagamochi, Hiroshi, Kawada, Taizo
Format: Journal Article
Language:English
Published: Lausanne Elsevier 15.05.2006
Amsterdam
New York, NY
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Theoretical computing
Edge(graph)
NP-hard
Graph partition
Computer theory
Vehicle routing
NP hard problem
Cactus
Tree
Connected graph
Approximation algorithm
Combinatorics
ISSN:0166-218X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
ISSN:0166-218X
DOI:10.1016/j.dam.2005.10.013