Algorithms for Finding the Weight-Constrained K Longest Paths in a Tree and the Length-Constrained K Maximum-Sum Segments of a Sequence

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2008.06.052
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2011English

The K-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks

2010English

The Algorithm of Finding of K Maximum Flows

SPIIRAS Proceedings
ControlSystems EngineeringInformation SystemsComputer NetworksApplied MathematicsMathematicsCommunicationsComputer Science ApplicationsComputational TheoryComputational MathematicsArtificial Intelligence
2014English

Finding K-Shortest Paths With Limited Overlap

VLDB Journal
HardwareInformation SystemsArchitecture
2020English

Clustering Using Boosted Constrained K-Means Algorithm

Frontiers Robotics AI
Computer Science ApplicationsArtificial Intelligence
2018English

On the Difficulty of Finding Walks of Length K

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1997English

Efficient Algorithms for Listing K Disjoint St-Paths in Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

A New Algorithm for Finding the K Shortest Paths in a Time-Schedule Network With Constraints on Arcs

Journal of Algorithms and Computational Technology
Computational MathematicsApplied MathematicsNumerical Analysis
2016English

Constrained Minimization Algorithms

EAS Publications Series
AstrophysicsEngineeringAstronomyPlanetary ScienceSpace
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy