yusuke1997/dblp-id-title huggingface dataset:
An LP-Rounding Based Algorithm for a Uniform Capacitated Facility Location Problem with Penalties
EFX Allocations Exist for Binary Valuations
Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine
Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem
Robust Facility Leasing Problem with Penalties
On Bayesian Epistemology of Myerson Auction
On the Problem of Best Arm Retention
Deterministic and Universal Truthful Mechanism for Fair Matching
Biometric Digital Signature Key Generation and Cryptography Communication Based on Fingerprint
The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting Model
Tree Convex Bipartite Graphs: NP -Complete Domination, Hamiltonicity and Treewidth
On the Fine-Grained Complexity of Approximating Max k-Coverage
Toward an Automatic Approach to Greedy Algorithms
A Hybrid Graph Representation for Recursive Backtracking Algorithms
Buffer Minimization with Conflicts on a Line
Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness
On Star-Cover and Path-Cover of a Tree
Approximation Schemes for Scheduling with Availability Constraints
Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph
Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract)
A Mechanism Design Approach for Multi-party Machine Learning
Approximation Algorithms for the Capacitated Domination Problem
Soft Subdivision Search in Motion Planning, II: Axiomatics
Influence Maximization Under the Non-progressive Linear Threshold Model
Randomized Strategyproof Mechanisms for Multi-Stage Facility Location Problem with Capacity Constraints
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination
Approximating Principal-Agent Problem Under Bayesian
Efficient Guarding of Polygons and Terrains
Exact Algorithms for the Maximum k-Balanced Weighted Biclique Problem
Positive Zero Forcing and Edge Clique Coverings
Distributed Planning for the On-Line Dial-a-Ride Problem
Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model
DDoS Attack Detection Algorithm Using IP Address Features
Finding Fair and Efficient Allocations Under Budget Constraints
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
On the NP-Hardness of Two Scheduling Problems Under Linear Constraints
A Case for Copeland: from Theory to Practice
Spanning Distribution Forests of Graphs - (Extended Abstract)
FPTAS's for Some Cut Problems in Weighted Trees
Extracting Information of Anti-AIDS Inhibitor from the Biological Literature Based on Ontology
Complete Submodularity Characterization in the Comparative Independent Cascade Model
A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
Frontiers of Algorithmics - 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 - July 2, 2025, Proceedings
Single Machine Scheduling Problem with a Flexible Maintenance Revisited
Differential Game Analysis for Cooperation Models in Automotive Supply Chain Under Low-Carbon Emission Reduction Policies
Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees
Better Approximation Algorithms for Scaffolding Problems
Realtime Channel Recommendation: Switch Smartly While Watching TV
Hardness and Algorithms for Electoral Manipulation Under Media Influence
Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares
Kernelization for P 2 -Packing: A Gerrymandering Approach
Fractional Edge Cover Number of Model RB
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Minimizing Blocking Agents for Stable Matching with Partial Approval Information
Frontiers of Algorithmics - 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023, Proceedings
Parameterized Minimum Cost Partition of a Tree with Supply and Demand
The Bounded Batch Scheduling with Common Due Window and Non-identical Size Jobs
Square and Rectangle Covering with Outliers
Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization
Efficient Algorithms for a Graph Partitioning Problem
Online Knapsack Problem Under Concave Functions
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
Lower and Upper Bounds for Random Mimimum Satisfiability Problem
The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation
A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains
Efficient Computation of the Characteristic Polynomial of a Threshold Graph
Finding Simple Paths on Given Points in a Polygonal Region
Optimal Surface Flattening
Covering-Based Routing Algorithms for Cyclic Content-Based P/S System
A Risk-Reward Model for On-line Financial Leasing Problem with an Interest Rate
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
On the Structure of Consistent Partitions of Substring Set of a Word
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores
An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding epsilon -Approximate Quantiles in a Data Stream
Eliciting Truthful Reports with Partial Signals in Repeated Games
String Rearrangement Inequalities and a Total Order Between Primitive Words
Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs
Searching Trees with Sources and Targets
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
Improved Approximation Algorithms for Multiprocessor Scheduling with Testing
An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine
Constraints Solution for Time Sensitive Security Protocols
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs
Car-Sharing: Online Scheduling k Cars Between Two Locations
The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives
Categorial Semantics of a Solution to Distributed Dining Philosophers Problem
Parallel Identifying ( l , d )-Motifs in Biosequences Using CPU and GPU Computing
The Broken-Triangle Property with Adjoint Values
Exact Algorithms for the Max-Min Dispersion Problem
Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
Designing and Implementing Algorithms for the Closest String Problem
A Linear In-situ Algorithm for the Power of Cyclic Permutation
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
Longest (k]-Tuple Common Substrings
Smaller Kernels for Several FPT Problems Based on Simple Observations
On the Minmax Regret Path Center Problem on Trees
Complexity Results for the Proper Disconnection of Graphs
On the Transversal Number of Rank k Hypergraphs
Dynamic Matchings in Left Weighted Convex Bipartite Graphs
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks
Understanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions
Recognizing d -Interval Graphs and d -Track Interval Graphs
Two-Way Jumping Automata
Improved Algorithms for Several Parameterized Problems Based on Random Methods
A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer
Maximize Egalitarian Welfare for Cake Cutting
Genomic Scaffold Filling: A Progress Report
Oblivious Robots Under Round Robin: Gathering on Rings
A Novel Business Model for Electric Car Sharing
On the Advice Complexity of One-Dimensional Online Bin Packing
Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms
Approximation Algorithms for Individual Preference Facility Location
Characterizing and Computing Minimal Cograph Completions
TBDS: Transaction-Based Data Sharing
Frontiers in Algorithmics - 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings
On Tractable Exponential Sums
Parameterized Algorithms for Maximum Edge Biclique and Related Problems
Frontiers in Algorithmics, 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings
Randomized Parameterized Algorithms for Co-path Set Problem
Visiting a Polygon on the Optimal Way to a Query Point
A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application
On Modulo Linked Graphs
Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings
Adaptive Algorithms for Planar Convex Hull Problems
Fixed Point Computation and Equilibrium
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
Single Vehicle's Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time
An Improved Database Classification Algorithm for Multi-database Mining
Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources
CFI Construction and Balanced Graphs
Optimally Integrating Ad Auction into E-Commerce Platforms
A CSP-Based Approach for Solving Parity Game
Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks
On the Complexity of Constrained Sequences Alignment Problems
Finding a Set of Long Common Substrings with Repeats from m Input Strings
Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
Progress on Certifying Algorithms
Algorithms for Queryable Uncertainty
Covered Interest Arbitrage in Exchange Rate Forecasting Markets
Constant Time Generation of Biconnected Rooted Plane Graphs
Breaking Cycle Structure to Improve Lower Bound for Max-SAT
On the Approximation and Smoothed Complexity of Leontief Market Equilibria
A 42k Kernel for the Complementary Maximal Strip Recovery Problem
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Low-Weight Superimposed Codes and Their Applications
Approximating Scheduling Machines with Capacity Constraints
Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems
An FPTAS for Stochastic Unbounded Min-Knapsack Problem
Frontiers in Algorithmics - 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings
A Fast and Practical Method to Estimate Volumes of Convex Polytopes
Frontiers in Algorithmics - 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings
Some (in)tractable Parameterizations of Coloring and List-Coloring
Approximating the Spanning k-Tree Forest Problem
Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making
On the Complexity of Approximation Streaming Algorithms for the k -Center Problem
Guarding Polyhedral Terrain by k-Watchtowers
Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints
Secure Computation of Any Boolean Function Based on Any Deck of Cards
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals
Complexity Classes for Online Problems with and Without Predictions
On the Optimal Mixing Problem of Approximate Nash Equilibria in Bimatrix Games
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
An Improved Approximation Algorithm for the k-Means Problem with Penalties
Zero-Sum Flow Numbers of Triangular Grids
Computing Minimum Diameter Color-Spanning Sets
A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle
Using Bit Selection to Do Routing Table Lookup
Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem
On Foundations of Services Interoperation in Cloud Computing
The Complexity of Zero-Visibility Cops and Robber
Graph Modification Problems: A Modern Perspective
On-line Scheduling with a Monotonous Subsequence Constraint
An Approximation Algorithm for the H-Prize-Collecting Power Cover Problem
On Counting Parameterized Matching and Packing
Vertex-Critical ( P_5 P 5 , banner)-Free Graphs
A Linear Time Algorithm for Ordered Partition
The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations
Cop-Robber Guarding Game with Cycle Robber Region
Equilibrium Strategies of Carbon Emission Reduction in Agricultural Product Supply Chain Under Carbon Sink Trading
Constrained Graph Searching on Trees
The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension
A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs
EFX Under Budget Constraint
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
Fair Value Distribution in Cooperative Committee Election
Truthful Auction for CPU Time Slots
Maximum Edge Bicliques in Tree Convex Bipartite Graphs
Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops
Stackelberg Strategies on Epidemic Containment Games
Multiplication of 0-1 Matrices via Clustering
On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback
Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings
A Fixed-Parameter Approach for Privacy-Protection with Global Recoding
Exact Algorithms for Allocation Problems
Pathwidth is NP-Hard for Weighted Trees
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant
The On-Line Rental Problem with Risk and Probabilistic Forecast
Equilibrium Analysis of Block Withholding Attack: An Evolutionary Game Perspective
The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
Computer Science in the Information Age
Easy Problems for Grid-Structured Graphs
A Novel Biology-Based Reversible Data Hiding Fusion Scheme
Balanced Random Constraint Satisfaction: Phase Transition and Hardness
Active Learning Supported Iterative Combinatorial Auctions
Scheduling Two Types of Jobs with Minimum Makespan
A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem
Union Closed Tree Convex Sets
Optimum Sweeps of Simple Polygons with Two Guards
Faster Algorithms for k-Subset Sum and Variations
Notes on Fractional (1, f )-Odd Factors of Graphs
A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition
NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k)
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes
A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance
Fluctuated Fitting Under the 𝓁 1 -metric
Long Alternating Cycles in Edge-Colored Complete Graphs
A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order
Characterizing Strategyproofness Through Score Functions in Voting Mechanisms
On the Longest Spanning Tree with Neighborhoods
A Scalable Algorithm for Graph-Based Active Learning
Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings
An LP-Rounding Based Algorithm for Soft Capacitated Facility Location Problem with Submodular Penalties
Verifiable Crowd Computing: Coping with Bounded Rationality
On the Complexity of Minimizing the Total Calibration Cost
Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold Filling
Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings
A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings
A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
Online Algorithms for the Newsvendor Problem with and without Censored Demands
Communication Complexity and Its Applications
Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints
Locating Two Facilities on a Square with a Minimum Distance Requirement
On Computational Aspects of Greedy Partitioning of Graphs
Generalized Sorting with Predictions Revisited
O ((log n ) 2 ) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems
On the Lower Bounds of Random Max 3 and 4-SAT
Kernelization of Two Path Searching Problems on Split Graphs
Learning with Sequential Minimal Transductive Support Vector Machine
A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow
Geodetic Contraction Games on Trees
An Efficient Physically-Based Model for Chinese Brush
SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data
Mechanism Design for One-Facility Location Game with Obnoxious Effects
Versioning Tree Structures by Path-Merging
Parity-Constrained k-Supplier Problem
Enumeration, Counting, and Random Generation of Ladder Lotteries
Super Solutions of Random Instances of Satisfiability
From Evolutionary Game Dynamics to Non-negative Matrix Factorization: Acceleration with Hessian Geometry
A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes
Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings
A Trigram Statistical Language Model Algorithm for Chinese Word Segmentation
Less-Excludable Mechanism for DAOs in Public Good Auctions
Pathologic Region Detection Algorithm for Prostate Ultrasonic Image Based on PCNN
Mutual Visibility by Robots with Persistent Memory
Read-Once Resolutions in Horn Formulas
Mixed Graph Covering with Target Constraints
Online Strategies for Evacuating from a Convex Region in the Plane
Approximate Model Counting via Extension Rule
The Subinterval Cover Problem
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
Path Separability of Graphs
A Max-Margin Learning Algorithm with Additional Features
A New Distributed Algorithm for Computing a Dominating Set on Grids
On Approximation Algorithms for Two-Stage Scheduling Problems
A Novel Heuristic Approach for Job Shop Scheduling Problem
Linear Time Algorithm for 1-Center in R d Under Convex Polyhedral Distance Function
Processing an Offline Insertion-Query Sequence with Applications
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy
A New Lower Bound for Positive Zero Forcing
Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties
Mechanism Design in Fair Sequencing
Ranking of Closeness Centrality for Large-Scale Social Networks
A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange
Graph Orientation with Edge Modifications
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
Study on Parallel Computing
Budget-Feasible Sybil-Proof Mechanisms for Crowdsensing
On r-Gatherings on the Line
Some New Structural Properties of Shortest 2-Connected Steiner Networks
Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity
Two-Facility Location Games with Distance Requirement
Multi-bidding Strategy in Sponsored Keyword Auction
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
Approximation Algorithms for the Directed Path Partition Problems
Estimating Hybrid Frequency Moments of Data Streams
A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees
How to Play Old Maid with Virtual Players
New Algorithms for Barrier Coverage with Mobile Sensors
Minimal Double Dominating Sets in Trees
Geometric Algorithms for the Constrained 1-D K -Means Clustering Problems and IMRT Applications
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Inapproximability of Maximal Strip Recovery: II
Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract)
Streaming Submodular Maximization with the Chance Constraint
Absorbing Random Walks and the NAE2SAT Problem
The Online Power Cover Problem on a Line
Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem
Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules
Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents
The PoA of Scheduling Game with Machine Activation Costs
Constrained Heterogeneous Two-Facility Location Games with Max-Variant Cost
On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions
Network measurement based redundancy model and maintenance in dynamic P2P storage systems
Application-specific modelling of information routing in wireless sensor networks
Efficient Allocation and Heterogeneous Composition of NVM Crossbar Arrays for Deep Learning Acceleration
Reducing worst-case execution time of hybrid SPM-caches
Reducing inter-task interference delay by optimizing bank-to-core mapping
Admission control in deadline-based network resource management
Relocation of gateway for enhanced timeliness in wireless sensor networks
Sensitivity analysis of availability of video streaming service in cloud computing
Flow policies: specification and enforcement
On the Use of Q-Learning to Solve the Selectable Virtual Network Embedding Problem
Parallel and distributed normalization of security events for instant attack analysis
Predicting Tor path compromise by exit port
29th International Performance Computing and Communications Conference, IPCCC 2010, 9-11 December 2010, Albuquerque, NM, USA
Fuzzy-based adaptive cross layer routing protocol for mobile ad hoc networks
Energy efficient sensor, relay and base station placements for coverage, connectivity and routing
Parallelized benchmark-driven performance evaluation of SMPs and tiled multi-core architectures for embedded systems
Make systematic conformance testing for BitTorrent protocol feasible: A CP-nets model based testing approach
Formulating a Comprehensive Cybersecurity Framework for Uncrewed Aerial Vehicles
Secure and Efficient Vehicle-to-Vehicle Task Offloading via Trust-Aware Collaboration
Integrated Bandwidth Variation Pattern Differentiation for HTTP Adaptive Streaming over 4G Cellular Networks
Optimum reference node deployment for indoor localization based on the average Mean Square Error minimization
Predicting the GNSS Pseudo-Measurement with a Hybrid Multi-Head Attention for Tightly-Coupled Navigation
Maille authorization - a distributed, redundant authorization protocol
A Trusted Distributed Crowdsourcing Framework Based on User Preferences
Denoising Network of Dynamic Features for Enhanced Malware Classification
Metrie learning with statistical features for network traffic classification
Free trade for hybrid multihop wireless networks