Imagen de Portada

FORWARD: Feasibility Oriented Random-Walk Inspired Algorithm for Radial Reconfiguration in Distribution Networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Vendrell, Joan, Bent, Russell, Kia, Solmaz
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

FORWARD: A Feasible Radial Reconfiguration Algorithm for Multi-Source Distribution Networks
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
por: Kia, Solmaz S.
Publicado: (2025)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

Microgrids optimal radial reconfiguration via FORWARD algorithm
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

Expanderizing Higher Order Random Walks
por: Alev, Vedat Levi, et al.
Publicado: (2024)

Estimating Random-Walk Probabilities in Directed Graphs
por: Bertram, Christian, et al.
Publicado: (2025)

DNF Learning via Locally Mixing Random Walks
por: Alman, Josh, et al.
Publicado: (2025)

Review of Three Algorithms That Build k-d Trees
por: Brown, Russell A.
Publicado: (2025)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
por: Grus, Josef, et al.
Publicado: (2024)

Online Algorithms with Randomly Infused Advice
por: Emek, Yuval, et al.
Publicado: (2023)

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
por: Geissmann, Barbara, et al.
Publicado: (2025)

Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
por: Cleary, Alan M., et al.
Publicado: (2024)

A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

A Simple Algorithm for Clustering Discrete Distributions
por: Mitra, Pradipta
Publicado: (2026)

Biclique Reconfiguration in Bipartite Graphs
por: Otachi, Yota, et al.
Publicado: (2026)

Distributed Graph Algorithms with Predictions
por: Boyar, Joan, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
por: Buchbinder, Niv, et al.
Publicado: (2026)

Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025)

Coloring Reconfiguration under Color Swapping
por: Fuchs, Janosch, et al.
Publicado: (2025)

Edge-Minimum Walk of Modular Length in Polynomial Time
por: Amarilli, Antoine, et al.
Publicado: (2024)

Discrete Effort Distribution via Regret-enabled Greedy Algorithm
por: Cao, Song, et al.
Publicado: (2025)

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
por: Wang, Ziao, et al.
Publicado: (2022)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
por: Zheng, Dehong, et al.
Publicado: (2025)

Chorba: A novel CRC32 implementation
por: Russell, Sam
Publicado: (2024)

Temporal Graph Reconfiguration for Always-Connected Graphs
por: Sievers, Paul, et al.
Publicado: (2025)

Enumerating m-Length Walks in Directed Graphs with Constant Delay
por: Adamson, Duncan, et al.
Publicado: (2024)

Differentially Private Learning of Exponential Distributions: Simple Algorithms and Tight Bounds
por: Mahpud, Bar, et al.
Publicado: (2025)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
por: Huang, Zengfeng, et al.
Publicado: (2025)

Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2026)

Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
por: Cardinal, Jean, et al.
Publicado: (2026)

Reconfiguring Multiple Connected Components with Size Multiset Constraints
por: Nakahata, Yu
Publicado: (2025)

Notes on Randomized Algorithms
por: Aspnes, James
Publicado: (2020)

Comparative Performance of the AVL Tree and Three Variants of the Red-Black Tree
por: Brown, Russell A.
Publicado: (2024)

Building a Balanced k-d Tree in O(kn log n) Time
por: Brown, Russell A.
Publicado: (2014)

A Dynamic, Self-balancing k-d Tree
por: Brown, Russell A.
Publicado: (2025)

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation
por: Schwartz, Oded, et al.
Publicado: (2025)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
por: Suga, Tatsuhiro, et al.
Publicado: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
por: Chekuri, Chandra, et al.
Publicado: (2024)