Saved in:
| Main Authors: | Weitzman, Shlomi, Sabato, Sivan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.01930 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
by: Chen, Yixin, et al.
Published: (2024)
by: Chen, Yixin, et al.
Published: (2024)
UniCO: Towards a Unified Model for Combinatorial Optimization Problems
by: Zong, Zefang, et al.
Published: (2025)
by: Zong, Zefang, et al.
Published: (2025)
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
by: Tukan, Murad, et al.
Published: (2024)
by: Tukan, Murad, et al.
Published: (2024)
HyP-ASO: A Hybrid Policy-based Adaptive Search Optimization Framework for Large-Scale Integer Linear Programs
by: Xu, Ning, et al.
Published: (2025)
by: Xu, Ning, et al.
Published: (2025)
A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization
by: Sanokowski, Sebastian, et al.
Published: (2024)
by: Sanokowski, Sebastian, et al.
Published: (2024)
On Training-Test (Mis)alignment in Unsupervised Combinatorial Optimization: Observation, Empirical Exploration, and Analysis
by: Bu, Fanchen, et al.
Published: (2025)
by: Bu, Fanchen, et al.
Published: (2025)
Federated Combinatorial Multi-Agent Multi-Armed Bandits
by: Fourati, Fares, et al.
Published: (2024)
by: Fourati, Fares, et al.
Published: (2024)
ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
by: Gallart, Joan Vendrell, et al.
Published: (2025)
by: Gallart, Joan Vendrell, et al.
Published: (2025)
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
by: Veldt, Nate, et al.
Published: (2025)
by: Veldt, Nate, et al.
Published: (2025)
MILP-StuDio: MILP Instance Generation via Block Structure Decomposition
by: Liu, Haoyang, et al.
Published: (2024)
by: Liu, Haoyang, et al.
Published: (2024)
Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors
by: Choi, Heejin, et al.
Published: (2024)
by: Choi, Heejin, et al.
Published: (2024)
Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
by: Zhou, Junru, et al.
Published: (2024)
by: Zhou, Junru, et al.
Published: (2024)
Differentiable Quadratic Optimization For The Maximum Independent Set Problem
by: Alkhouri, Ismail, et al.
Published: (2024)
by: Alkhouri, Ismail, et al.
Published: (2024)
A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility
by: Batool, Muniba, et al.
Published: (2024)
by: Batool, Muniba, et al.
Published: (2024)
HYGENE: A Diffusion-based Hypergraph Generation Method
by: Gailhard, Dorian, et al.
Published: (2024)
by: Gailhard, Dorian, et al.
Published: (2024)
Graph-Based Semi-Supervised Segregated Lipschitz Learning
by: Bozorgnia, Farid, et al.
Published: (2024)
by: Bozorgnia, Farid, et al.
Published: (2024)
Extended Deep Submodular Functions
by: Hosseini, Seyed Mohammad, et al.
Published: (2024)
by: Hosseini, Seyed Mohammad, et al.
Published: (2024)
Box Facets and Cut Facets of Lifted Multicut Polytopes
by: Naumann, Lucas Fabian, et al.
Published: (2024)
by: Naumann, Lucas Fabian, et al.
Published: (2024)
Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks
by: Shafi, Zohair, et al.
Published: (2023)
by: Shafi, Zohair, et al.
Published: (2023)
Deep Learning for Unrelated-Machines Scheduling: Handling Variable Dimensions
by: Hitzges, Diego, et al.
Published: (2025)
by: Hitzges, Diego, et al.
Published: (2025)
Sample compression schemes for balls in graphs
by: Chalopin, Jérémie, et al.
Published: (2022)
by: Chalopin, Jérémie, et al.
Published: (2022)
Feature-Aware (Hyper)graph Generation via Next-Scale Prediction
by: Gailhard, Dorian, et al.
Published: (2025)
by: Gailhard, Dorian, et al.
Published: (2025)
A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
by: Baumann, Philipp, et al.
Published: (2026)
by: Baumann, Philipp, et al.
Published: (2026)
Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions
by: Cömer, Can, et al.
Published: (2025)
by: Cömer, Can, et al.
Published: (2025)
Isolation Forest in Novelty Detection Scenario
by: Ulrich, Adam, et al.
Published: (2025)
by: Ulrich, Adam, et al.
Published: (2025)
Contradiction Graphs Determine VC Dimension
by: Campbell, Jesse, et al.
Published: (2026)
by: Campbell, Jesse, et al.
Published: (2026)
On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
by: Pluska, Alexander, et al.
Published: (2025)
by: Pluska, Alexander, et al.
Published: (2025)
Partial Optimality in Cubic Correlation Clustering for General Graphs
by: Stein, David, et al.
Published: (2025)
by: Stein, David, et al.
Published: (2025)
On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth
by: Averkov, Gennadiy, et al.
Published: (2025)
by: Averkov, Gennadiy, et al.
Published: (2025)
GraphOmni: A Comprehensive and Extensible Benchmark Framework for Large Language Models on Graph-theoretic Tasks
by: Xu, Hao, et al.
Published: (2025)
by: Xu, Hao, et al.
Published: (2025)
Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
by: Dabah, Adel
Published: (2026)
by: Dabah, Adel
Published: (2026)
Designing ReLU Generative Networks to Enumerate Trees with a Given Tree Edit Distance
by: Ghafoor, Mamoona, et al.
Published: (2025)
by: Ghafoor, Mamoona, et al.
Published: (2025)
Graphon Mixtures
by: Kandanaarachchi, Sevvandi, et al.
Published: (2025)
by: Kandanaarachchi, Sevvandi, et al.
Published: (2025)
Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums
by: Ohnishi, Motoya, et al.
Published: (2022)
by: Ohnishi, Motoya, et al.
Published: (2022)
Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
by: Crane, Alex, et al.
Published: (2025)
by: Crane, Alex, et al.
Published: (2025)
A Unified Approach to Submodular Maximization Under Noise
by: Bhawalkar, Kshipra, et al.
Published: (2025)
by: Bhawalkar, Kshipra, et al.
Published: (2025)
Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
by: Gadekar, Ameet, et al.
Published: (2024)
by: Gadekar, Ameet, et al.
Published: (2024)
A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
by: Ta, Hoang, et al.
Published: (2025)
by: Ta, Hoang, et al.
Published: (2025)
Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
by: Zhang, Bohang, et al.
Published: (2024)
by: Zhang, Bohang, et al.
Published: (2024)
Are Graph Neural Networks Optimal Approximation Algorithms?
by: Yau, Morris, et al.
Published: (2023)
by: Yau, Morris, et al.
Published: (2023)
Similar Items
-
Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
by: Chen, Yixin, et al.
Published: (2024) -
UniCO: Towards a Unified Model for Combinatorial Optimization Problems
by: Zong, Zefang, et al.
Published: (2025) -
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
by: Tukan, Murad, et al.
Published: (2024) -
HyP-ASO: A Hybrid Policy-based Adaptive Search Optimization Framework for Large-Scale Integer Linear Programs
by: Xu, Ning, et al.
Published: (2025) -
A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization
by: Sanokowski, Sebastian, et al.
Published: (2024)