The following pages link to Vassilios Zissimopoulos (Q1029096):
Displaying 46 items.
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- On the performance guarantee of neural networks for NP-hard optimization problems (Q672967) (← links)
- (Q963380) (redirect page) (← links)
- Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity (Q963381) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Autocorrelation coefficient for the graph bipartitioning problem (Q1127331) (← links)
- Performance of a neural network method with set partitioning (Q1199894) (← links)
- A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← links)
- On the quality of local search for the quadratic assignment problem (Q1383366) (← links)
- An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370) (← links)
- An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension (Q1391539) (← links)
- Evaluation of reliability bounds by set covering models. (Q1424481) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- The antennas preassignment problem (Q1766595) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- Calibrations scheduling with arbitrary lengths and activation length (Q2066688) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Optimal data placement on networks with a constant number of clients (Q2453166) (← links)
- Clustering on k-Edge-Colored Graphs (Q2849897) (← links)
- Bin Packing with Colocations (Q2971155) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- (Q3059322) (← links)
- (Q3070898) (← links)
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems (Q3157808) (← links)
- Steiner Forests on Stochastic Metric Graphs (Q3611962) (← links)
- (Q3724077) (← links)
- (Q4289901) (← links)
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm (Q4367021) (← links)
- (Q4427774) (← links)
- On the Complexity of Minimizing the Total Calibration Cost (Q4632198) (← links)
- A New Efficient Heuristic for the Minimum Set Covering Problem (Q4864354) (← links)
- (Q5005125) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Methods and Applications of Artificial Intelligence (Q5307313) (← links)
- Updating Directed Minimum Cost Spanning Trees (Q5307551) (← links)
- On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems (Q5375431) (← links)
- Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions (Q5689727) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902002) (← links)
- On the landscape ruggedness of the quadratic assignment problem (Q5941510) (← links)
- A semi brute-force search approach for (balanced) clustering (Q6185939) (← links)
