◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Sedeño-Noda

3 papers hereh-index 17723 citations46 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.DM2
  • cs.DS1

identity via Semantic Scholar / OpenAlex

most citedTargeted Multiobjective Dijkstra Algorithm

11 citations · 11 across the 3 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2023

New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem

Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer

The Multiobjective Minimum Spanning Tree (MO-MST) problem is a variant of the Minimum Spanning Tree problem, in which the costs associated with every edge of the input graph are ve…

cs.DM2021★ 11 cited

Targeted Multiobjective Dijkstra Algorithm

Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda +1

In this paper, we introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for the One-to-One Multiobjective Shortest Path (MOSP) Problem. The T-…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.