Results 161 to 170 of about 3,161 (171)
Some of the next articles are maybe not open access.

Submodular Minimization via Pathwidth

2012
In this paper, we present a submodular minimization algorithm based on a new relationship between minimizers of a submodular set function and pathwidth defined on submodular set functions. Given a submodular set function f on a finite set V with n ≥2 elements and an ordered pair s ,t ∈V , let λ s ,t denote the minimum f (X ) over all sets X with s ∈X ...
openaire   +2 more sources

On Coverage in Multi-Interface Networks with Bounded Pathwidth

International Conference on Advanced Information Networking and Applications
Alessandro Aloisio, Alfredo Navarra
semanticscholar   +1 more source

Min-Max Coverage in Multi-interface Networks: Pathwidth

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing
Alessandro Aloisio
semanticscholar   +1 more source

Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth

International Workshop on Graph-Theoretic Concepts in Computer Science
Miriam Münch   +2 more
semanticscholar   +1 more source

Approximation Algorithms for Treewidth, Pathwidth, and Treedepth - A Short Survey

International Workshop on Graph-Theoretic Concepts in Computer Science
H. Bodlaender
semanticscholar   +1 more source

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering

Algorithmic Applications in Management, 2020
Yunlong Liu   +3 more
semanticscholar   +1 more source

The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

SIAM Journal on Discrete Mathematics, 2016
G. Gutin, Mark Jones, Magnus Wahlström
semanticscholar   +1 more source

Computing Directed Pathwidth in $$O(1.89^{n})$$O(1.89n) Time

Algorithmica, 2016
Kenta Kitsunai   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy